S. Lucks. Design principles for Iterated Hash Functions. ePrint Archive Report, 2004. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Designs of Efficient Secure Large Hash Values - Nandi (2005) (Correct)
No context found.
S. Lucks. Design principles for Iterated Hash Functions. ePrint Archive Report, 2004.
Merkle-Damgård Revisited: How to Construct a Hash.. - Coron, Dodis, Malinaud, .. (2005) (Correct)
No context found.
Stefan Lucks. Design Principles for Iterated Hash Functions, available at E-Print Archive, http://eprint.iacr.org/2004/253.
Designs of Efficient Secure Large Hash Values - Nandi (2004) (Correct)
No context found.
S. Lucks. Design principles for Iterated Hash Functions, e-print server : http://eprint.iacr.org/2004/253.
MD5 to Be Considered Harmful Someday - Kaminsky (2004) (Correct)
No context found.
Stefan Lucks, "Design principles for iterated hash functions," Cryptology ePrint Archive, Report
Second Preimages on n-bit Hash Functions for Much Less than.. - Kelsey, Schneier (2004) (Correct)
No context found.
Lucks, "Design Principles for Iterated Hash Functions," IACR preprint archive, http://eprint.iacr.org/2004/253.pdf, 2004.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC