Full Cryptanalysis of LPS and Morgenstern Hash Functions
- 1 January 2008
- book chapter
- Published by Springer Nature
- Vol. 2008, 263-277
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Cryptographic Hash Functions from Expander GraphsJournal of Cryptology, 2007
- Expander graphs and their applicationsBulletin of the American Mathematical Society, 2006
- VSH, an Efficient and Provable Collision-Resistant Hash Function2006
- Hashing with SL 22001
- Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power qJournal of Combinatorial Theory, Series B, 1994
- Hash functions and Cayley graphsDesigns, Codes and Cryptography, 1994
- Group-theoretic hash functionsLecture Notes in Computer Science, 1994
- Gaussian limiting distributions for the number of components in combinatorial structuresJournal of Combinatorial Theory, Series A, 1990
- On the deterministic complexity of factoring polynomials over finite fieldsInformation Processing Letters, 1990
- Ramanujan graphsCombinatorica, 1988