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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages11-20
Number of pages10
Volume5576 LNCS
DOIs
Publication statusPublished - 2009 Nov 9
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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Hash functions
Hash Function
Compression Function
Collision
Convert
Processing

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Lee, J., Hong, S., Sung, J., & Park, H. (2009). A new double-block-length hash function using feistel structure. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5576 LNCS, 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

A new double-block-length hash function using feistel structure. / Lee, Jesang; Hong, Seokhie; Sung, Jaechul; Park, Haeryong.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5576 LNCS 2009. p. 11-20 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5576 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lee, J, Hong, S, Sung, J & Park, H 2009, A new double-block-length hash function using feistel structure. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5576 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5576 LNCS, pp. 11-20, 3rd International Conference on Information Security and Assurance, ISA 2009, Seoul, Korea, Republic of, 09/6/25. https://doi.org/10.1007/978-3-642-02617-1_2
Lee J, Hong S, Sung J, Park H. A new double-block-length hash function using feistel structure. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5576 LNCS. 2009. p. 11-20. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-02617-1_2
Lee, Jesang ; Hong, Seokhie ; Sung, Jaechul ; Park, Haeryong. / A new double-block-length hash function using feistel structure. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5576 LNCS 2009. pp. 11-20 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{7651b0b872a54d6f8469d212b0bd0c43,
title = "A new double-block-length hash function using feistel structure",
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.",
keywords = "Block Ciphers, Double Block Length Hash Function, Hash Function",
author = "Jesang Lee and Seokhie Hong and Jaechul Sung and Haeryong Park",
year = "2009",
month = "11",
day = "9",
doi = "10.1007/978-3-642-02617-1_2",
language = "English",
isbn = "3642026168",
volume = "5576 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "11--20",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

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

AU - Lee, Jesang

AU - Hong, Seokhie

AU - Sung, Jaechul

AU - Park, Haeryong

PY - 2009/11/9

Y1 - 2009/11/9

N2 - 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.

AB - 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.

KW - Block Ciphers

KW - Double Block Length Hash Function

KW - Hash Function

UR - http://www.scopus.com/inward/record.url?scp=70350686291&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70350686291&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-02617-1_2

DO - 10.1007/978-3-642-02617-1_2

M3 - Conference contribution

SN - 3642026168

SN - 9783642026164

VL - 5576 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 11

EP - 20

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -