PSIpress (2009)

Authors
Mark Bedau
Reed College
Michael J. Raven
University of Victoria
Abstract
There is a long history of cryptographic hash functions, i.e. functions mapping variable-length strings to fixed-length strings, and such functions are also expected to enjoy certain security properties. Hash functions can be effected via modular arithmetic, permutation-based schemes, chaotic mixing, and so on. Herein we introduce the notion of an artificial-life (ALife) hash function (ALHF), whereby the requisite mixing action of a good hash function is accomplished via ALife rules that give rise to complex evolution of a given system. Various security tests have been run, and the results reported for examples of ALHFs
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Translate to english
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 51,756
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Ethics and Artificial Life: From Modeling to Moral Agents. [REVIEW]John P. Sullins - 2005 - Ethics and Information Technology 7 (3):139-148.
Time Polynomial in Input or Output.Yuri Gurevich & Saharon Shelah - 1989 - Journal of Symbolic Logic 54 (3):1083-1088.
Generalised Biological Function.Jacques Viret - 2005 - Acta Biotheoretica 53 (4):393-409.

Analytics

Added to PP index
2012-06-15

Total views
488 ( #11,435 of 2,333,947 )

Recent downloads (6 months)
1 ( #585,936 of 2,333,947 )

How can I increase my downloads?

Downloads

My notes