DUAL PROBLEM OF HASH ALGORITHM

Zhu Huafei; Yang Bo; Wang Xinmei; Xiao Guozhen

Volume 20 Issue 4

Jul. 1998

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 1998 > 20(4): 527-530

Zhu Huafei, Yang Bo, Wang Xinmei, Xiao Guozhen. DUAL PROBLEM OF HASH ALGORITHM[J]. Journal of Electronics & Information Technology, 1998, 20(4): 527-530.

Citation:

Zhu Huafei, Yang Bo, Wang Xinmei, Xiao Guozhen. DUAL PROBLEM OF HASH ALGORITHM[J]. Journal of Electronics & Information Technology, 1998, 20(4): 527-530.

Zhu Huafei, Yang Bo, Wang Xinmei, Xiao Guozhen. DUAL PROBLEM OF HASH ALGORITHM[J]. Journal of Electronics & Information Technology, 1998, 20(4): 527-530.

Citation:

Zhu Huafei, Yang Bo, Wang Xinmei, Xiao Guozhen. DUAL PROBLEM OF HASH ALGORITHM[J]. Journal of Electronics & Information Technology, 1998, 20(4): 527-530.

PDF( 730 KB)

DUAL PROBLEM OF HASH ALGORITHM

Received Date: 1997-01-15
Rev Recd Date: 1998-01-04
Publish Date: 1998-07-19

Abstract

Abstract

Hash algorithm is always with high operation speed such as MDx, SHA. A natural problem is that could one apply for a fast hash scheme to construct a cipher block algorithm. This paper denotes such a problem as dual problem of hash algorithm. Based on the known result, it is proved that several fast secure block cipher can be constructed if a fast secure hash algorithm is given.

FullText(HTML)

References(1)

References

Luby M, Rackoff C. How to construct pseudorandom permutations from pseudorandom functions[J].SIAM Journal on Computing.1988, 17(2):373-386[2]Patarin J. New results on pseudorandom permutation generators based on the DES Scheme, Abstracts of Crypto91, Santa Barbara, CA, USA: 1991, 72-77.[3]Patarin J. How to construct pseudorandom and super pseudorandom permutations from one single pseudorandom function. In Abstracts of Eurocrypt92, Balatonfured, Hungary: 1992, 235-245.[4]朱华飞.密码安全杂凑算法的设计与应用:[博士论文].西安:西安电子科技大学,1996年10月.

Relative Articles

Supplements(0)

Cited By

Proportional views