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

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

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

6 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 languageEnglish
Title of host publicationPublic Key Cryptography - 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998, Proceedings
PublisherSpringer Verlag
Pages234-246
Number of pages13
Volume1431
ISBN (Print)3540646930, 9783540646938
DOIs
Publication statusPublished - 1998
Externally publishedYes
Event1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998 - Pacifico Yokohama, Japan
Duration: 1998 Feb 51998 Feb 6

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1431
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998
CountryJapan
CityPacifico Yokohama
Period98/2/598/2/6

Fingerprint

Message Authentication Code
Hash functions
Hash Function
Authentication
Family
SHA-1
Dependent Data
Attack

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Uk Shin, S., Hyune Rhee, K., Hyun Ryu, D., & Lee, S. (1998). A new hash function based on mdx-family and its application to MAC. In Public Key Cryptography - 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998, Proceedings (Vol. 1431, 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; Lee, Sangjin.

Public Key Cryptography - 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998, Proceedings. Vol. 1431 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 proceedingConference contribution

Uk Shin, S, Hyune Rhee, K, Hyun Ryu, D & Lee, S 1998, A new hash function based on mdx-family and its application to MAC. in Public Key Cryptography - 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998, Proceedings. vol. 1431, 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, Lee S. A new hash function based on mdx-family and its application to MAC. In Public Key Cryptography - 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998, Proceedings. Vol. 1431. Springer Verlag. 1998. p. 234-246. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/BFb0054028
Uk Shin, Sang ; Hyune Rhee, Kyung ; Hyun Ryu, Dae ; Lee, Sangjin. / 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. Vol. 1431 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 Sangjin Lee",
year = "1998",
doi = "10.1007/BFb0054028",
language = "English",
isbn = "3540646930",
volume = "1431",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "234--246",
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 - Lee, Sangjin

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

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

U2 - 10.1007/BFb0054028

DO - 10.1007/BFb0054028

M3 - Conference contribution

AN - SCOPUS:84855316316

SN - 3540646930

SN - 9783540646938

VL - 1431

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

PB - Springer Verlag

ER -