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

Jesang Lee; Seokhie Hong; Jaechul Sung; Haeryong Park

doi:10.1007/978-3-642-02617-1_2

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

Jesang Lee, Seokhie Hong, Jaechul Sung, Haeryong Park

Department of Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

9 Scopus citations

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 language	English
Title of host publication	Advances in Information Security and Assurance - Third International Conference and Workshops, ISA 2009, Proceedings
Pages	11-20
Number of pages	10
DOIs	https://doi.org/10.1007/978-3-642-02617-1_2
State	Published - 2009
Event	3rd International Conference on Information Security and Assurance, ISA 2009 - Seoul, Korea, Republic of Duration: 25 Jun 2009 → 27 Jun 2009

Publication series

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

Conference

Conference	3rd International Conference on Information Security and Assurance, ISA 2009
Country/Territory	Korea, Republic of
City	Seoul
Period	25/06/09 → 27/06/09

Keywords

Block Ciphers
Double Block Length Hash Function
Hash Function

Access to Document

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

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

Lee, Jesang ; Hong, Seokhie ; Sung, Jaechul et al. / A new double-block-length hash function using feistel structure. Advances in Information Security and Assurance - Third International Conference and Workshops, ISA 2009, Proceedings. 2009. pp. 11-20 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{e9fe38e0b58042c1aca2f7bf592360f8,

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",

doi = "10.1007/978-3-642-02617-1_2",

language = "English",

isbn = "3642026168",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "11--20",

booktitle = "Advances in Information Security and Assurance - Third International Conference and Workshops, ISA 2009, Proceedings",

note = "3rd International Conference on Information Security and Assurance, ISA 2009 ; Conference date: 25-06-2009 Through 27-06-2009",

}

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. 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, 25/06/09. 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 et al.
Advances in Information Security and Assurance - Third International Conference and Workshops, ISA 2009, Proceedings. 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 proceeding › Conference contribution › peer-review

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

Y1 - 2009

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

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

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

M3 - Conference contribution

AN - SCOPUS:70350686291

SN - 3642026168

SN - 9783642026164

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

SP - 11

EP - 20

BT - Advances in Information Security and Assurance - Third International Conference and Workshops, ISA 2009, Proceedings

T2 - 3rd International Conference on Information Security and Assurance, ISA 2009

Y2 - 25 June 2009 through 27 June 2009

ER -

Lee J, Hong S, Sung J, Park H. 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. 2009. p. 11-20. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-02617-1_2

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

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this