A new hash function based on mdx-family and its application to MAC

Sang Uk Shin; Kyung Hyune Rhee; Dae Hyun Ryu; Sang Jin Lee

doi:10.1007/BFb0054028

A new hash function based on mdx-family and its application to MAC

Sang Uk Shin, Kyung Hyune Rhee, Dae Hyun Ryu, Sang Jin Lee

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

8 Citations (Scopus)

Abstract

Several fast software hash functions have been proposed since the hash function MD4 was introduced by R. Rivest in 1990. At the moment, SHA-1, RIPEMD-160, and HAVAL are known as secure dedicated hash functions in MDx-family hash functions. In this paper, we propose a new hash function based on advantages of these three hash functions, which keeps the maximum security of them and is more efficient in performance. The proposed hash function processes an arbitrary finite message by 512-bit block and outputs 160 bits digest. The key feature of the proposed hash function is data-dependent rotation. This feature guarantees the strength against existing known attacks. Moreover, we propose a new keyed MAC(Message Authentication Code) constructed using the proposed hash function. The proposed MAC uses a maximum keys of 160 bits and has a bitlength less than equal to the hash result. From the viewpoint of performance, the proposed MAC is only reduced about 10~ comparing to the underlying hash function.

Original language	English
Title of host publication	Public Key Cryptography - 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998, Proceedings
Editors	Yuliang Zheng, Hideki Imai
Publisher	Springer Verlag
Pages	234-246
Number of pages	13
ISBN (Print)	3540646930, 9783540646938
DOIs	https://doi.org/10.1007/BFb0054028
Publication status	Published - 1998
Externally published	Yes
Event	1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998 - Pacifico Yokohama, Japan Duration: 1998 Feb 5 → 1998 Feb 6

Publication series

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

Other

Other	1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998
Country/Territory	Japan
City	Pacifico Yokohama
Period	98/2/5 → 98/2/6

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/BFb0054028

Cite this

Uk Shin, S., Hyune Rhee, K., Hyun Ryu, D., & Jin Lee, S. (1998). A new hash function based on mdx-family and its application to MAC. In Y. Zheng, & H. Imai (Eds.), Public Key Cryptography - 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998, Proceedings (pp. 234-246). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1431). Springer Verlag. https://doi.org/10.1007/BFb0054028

A new hash function based on mdx-family and its application to MAC. / Uk Shin, Sang; Hyune Rhee, Kyung; Hyun Ryu, Dae et al.
Public Key Cryptography - 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998, Proceedings. ed. / Yuliang Zheng; Hideki Imai. Springer Verlag, 1998. p. 234-246 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1431).

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

Uk Shin, S, Hyune Rhee, K, Hyun Ryu, D & Jin Lee, S 1998, A new hash function based on mdx-family and its application to MAC. in Y Zheng & H Imai (eds), Public Key Cryptography - 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1431, Springer Verlag, pp. 234-246, 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998, Pacifico Yokohama, Japan, 98/2/5. https://doi.org/10.1007/BFb0054028

Uk Shin S, Hyune Rhee K, Hyun Ryu D, Jin Lee S. A new hash function based on mdx-family and its application to MAC. In Zheng Y, Imai H, editors, Public Key Cryptography - 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998, Proceedings. Springer Verlag. 1998. p. 234-246. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/BFb0054028

Uk Shin, Sang ; Hyune Rhee, Kyung ; Hyun Ryu, Dae et al. / A new hash function based on mdx-family and its application to MAC. Public Key Cryptography - 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998, Proceedings. editor / Yuliang Zheng ; Hideki Imai. Springer Verlag, 1998. pp. 234-246 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{f9f3b290693b46fea8d8395932c41971,

title = "A new hash function based on mdx-family and its application to MAC",

abstract = "Several fast software hash functions have been proposed since the hash function MD4 was introduced by R. Rivest in 1990. At the moment, SHA-1, RIPEMD-160, and HAVAL are known as secure dedicated hash functions in MDx-family hash functions. In this paper, we propose a new hash function based on advantages of these three hash functions, which keeps the maximum security of them and is more efficient in performance. The proposed hash function processes an arbitrary finite message by 512-bit block and outputs 160 bits digest. The key feature of the proposed hash function is data-dependent rotation. This feature guarantees the strength against existing known attacks. Moreover, we propose a new keyed MAC(Message Authentication Code) constructed using the proposed hash function. The proposed MAC uses a maximum keys of 160 bits and has a bitlength less than equal to the hash result. From the viewpoint of performance, the proposed MAC is only reduced about 10~ comparing to the underlying hash function.",

author = "{Uk Shin}, Sang and {Hyune Rhee}, Kyung and {Hyun Ryu}, Dae and {Jin Lee}, Sang",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1998.; 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998 ; Conference date: 05-02-1998 Through 06-02-1998",

year = "1998",

doi = "10.1007/BFb0054028",

language = "English",

isbn = "3540646930",

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

publisher = "Springer Verlag",

pages = "234--246",

editor = "Yuliang Zheng and Hideki Imai",

booktitle = "Public Key Cryptography - 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998, Proceedings",

}

TY - GEN

T1 - A new hash function based on mdx-family and its application to MAC

AU - Uk Shin, Sang

AU - Hyune Rhee, Kyung

AU - Hyun Ryu, Dae

AU - Jin Lee, Sang

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1998.

PY - 1998

Y1 - 1998

N2 - Several fast software hash functions have been proposed since the hash function MD4 was introduced by R. Rivest in 1990. At the moment, SHA-1, RIPEMD-160, and HAVAL are known as secure dedicated hash functions in MDx-family hash functions. In this paper, we propose a new hash function based on advantages of these three hash functions, which keeps the maximum security of them and is more efficient in performance. The proposed hash function processes an arbitrary finite message by 512-bit block and outputs 160 bits digest. The key feature of the proposed hash function is data-dependent rotation. This feature guarantees the strength against existing known attacks. Moreover, we propose a new keyed MAC(Message Authentication Code) constructed using the proposed hash function. The proposed MAC uses a maximum keys of 160 bits and has a bitlength less than equal to the hash result. From the viewpoint of performance, the proposed MAC is only reduced about 10~ comparing to the underlying hash function.

AB - Several fast software hash functions have been proposed since the hash function MD4 was introduced by R. Rivest in 1990. At the moment, SHA-1, RIPEMD-160, and HAVAL are known as secure dedicated hash functions in MDx-family hash functions. In this paper, we propose a new hash function based on advantages of these three hash functions, which keeps the maximum security of them and is more efficient in performance. The proposed hash function processes an arbitrary finite message by 512-bit block and outputs 160 bits digest. The key feature of the proposed hash function is data-dependent rotation. This feature guarantees the strength against existing known attacks. Moreover, we propose a new keyed MAC(Message Authentication Code) constructed using the proposed hash function. The proposed MAC uses a maximum keys of 160 bits and has a bitlength less than equal to the hash result. From the viewpoint of performance, the proposed MAC is only reduced about 10~ comparing to the underlying hash function.

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

U2 - 10.1007/BFb0054028

DO - 10.1007/BFb0054028

M3 - Conference contribution

AN - SCOPUS:84855316316

SN - 3540646930

SN - 9783540646938

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

SP - 234

EP - 246

BT - Public Key Cryptography - 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998, Proceedings

A2 - Zheng, Yuliang

A2 - Imai, Hideki

PB - Springer Verlag

T2 - 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998

Y2 - 5 February 1998 through 6 February 1998

ER -

A new hash function based on mdx-family and its application to MAC

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this