## Enrico ZimuelEnrico Zimuel is a research programmer at the Informatics Institute of the University of Amsterdam (the Netherlands). He received his laurea degree cum laude in computer science and economics from the G. d'Annunzio University of Chieti-Pescara (Italy). He worked as an IT consultant for more than 10 years, with many
Italian companies in the sectors of IT security and software development.
In 1999 he coauthored a book about cryptography named Now he collaborates with the Science Department of the G. d'Annunzio University of Chieti-Pescara. His (other) personal interests include traveling, electronic music, computer art, poetry, cinema, free climbing, kickboxing, swimming, mountain biking, etc. A New Cryptographic Hash Function Based on the Cellular Automaton Rule 30 The aim of my project is to use the cellular automaton rule 30 to
create a secure cryptographic hash function. A hash function The basic requirements for a cryptographic hash function are: - The input can be of any length
- The output has a fixed length
*H*(*x*) is relatively easy to compute for any given x*H*(*x*) is*one-way**H*(*x*) is*collision-free*
A hash function If, given a message A I'll use the Avalanche Test and the Collision Test to prove the security of the hash function. Moreover, I'll investigate the global and local reversibility of the cellular automaton rule 30. Rule chosen: 2536347893 Note: This number is prime. |