Skip to main content
Conference ProceedingsOPEN ACCESS

Collisions for the LPS expander graph hash function

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 4965 LNCS 254-269
DOI: 10.1007/978-3-540-78967-3_15
18Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Tillich, J. P., & Zémor, G. (2008). Collisions for the LPS expander graph hash function. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4965 LNCS, pp. 254–269). Springer Verlag. https://doi.org/10.1007/978-3-540-78967-3_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free