Hash functions and Cayley graphs
Designs, Codes and Cryptography
Authentication of sequences with the SL2 hash function: application to video sequences
Journal of Computer Security - Special issue on security in the World Wide Web
Group-theoretic hash functions
Proceedings of the First French-Israeli Workshop on Algebraic Coding
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Attacking the SL2 Hashing Scheme
ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
A Note on the Hash Function of Tillich and Zémor
Proceedings of the Third International Workshop on Fast Software Encryption
Cryptographic Hash Functions from Expander Graphs
Journal of Cryptology
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
Full Cryptanalysis of LPS and Morgenstern Hash Functions
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Hash Functions from Sigma Protocols and Improvements to VSH
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The State of Hash Functions and the NIST SHA-3 Competition
Information Security and Cryptology
Interpreting hash function security proofs
ProvSec'10 Proceedings of the 4th international conference on Provable security
Preimages for the Tillich-Zémor hash function
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
The first 30 years of cryptographic hash functions and the NIST SHA-3 competition
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
| Hi-index | 0.00 |
We analyse the hash function family based on walks in LPS Ramanujan graphs recently introduced by Charles et al. We present an algorithm for finding collisions that runs in quasi-linear time in the length of the hashed value. A concrete instance of the hash function is considered, based on a 100-digit prime. A short collision is given, together with implementation details.