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 contribution

9 Citations (Scopus)

Abstract

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
Pages11-20
Number of pages10
DOIs
Publication statusPublished - 2009
Event3rd International Conference on Information Security and Assurance, ISA 2009 - Seoul, Korea, Republic of
Duration: 2009 Jun 252009 Jun 27

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

Other

Other3rd International Conference on Information Security and Assurance, ISA 2009
CountryKorea, Republic of
CitySeoul
Period09/6/2509/6/27

Keywords

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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

  • Cite this

    Lee, J., Hong, S., Sung, J., & Park, H. (2009). A new double-block-length hash function using feistel structure. In Advances in Information Security and Assurance - Third International Conference and Workshops, ISA 2009, Proceedings (pp. 11-20). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5576 LNCS). https://doi.org/10.1007/978-3-642-02617-1_2