Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
A New Double-Block-Length Hash Function Using Feistel Structure
verfasst von : Jesang Lee, Seokhie Hong, Jaechul Sung, Haeryong Park
Erschienen in: Advances in Information Security and Assurance
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We propose new double-block-length hash functions. Our approach for constructing collision-resistant double-block-length hash functions is to convert a blockcipher
E
with
n
-bit block length and 2
n
-bit key length to a 3-round Feistel cipher
E
*
with 2
n
-bit block length, and then to embed
E
*
in PGV compression functions. We prove that 12 hash functions with the group-1 PGV compression functions in which
E
*
is embedded are collision-resistant in the ideal cipher model. Furthermore, since our hash functions have the hash rate 2/3, they are more efficient than any other existing double-block-length hash functions in terms of the number of blockcipher calls required for processing messages.