A new double-block-length hash function using feistel structure

Jesang Lee, Seokhie Hong, Jaechul Sung, Haeryong Park

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations


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 2n-bit key length to a 3-round Feistel cipher E* with 2n-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.

Original languageEnglish
Title of host publicationAdvances in Information Security and Assurance - Third International Conference and Workshops, ISA 2009, Proceedings
Number of pages10
StatePublished - 2009
Event3rd International Conference on Information Security and Assurance, ISA 2009 - Seoul, Korea, Republic of
Duration: 25 Jun 200927 Jun 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5576 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference3rd International Conference on Information Security and Assurance, ISA 2009
Country/TerritoryKorea, Republic of


  • Block Ciphers
  • Double Block Length Hash Function
  • Hash Function


Dive into the research topics of 'A new double-block-length hash function using feistel structure'. Together they form a unique fingerprint.

Cite this