基于强单向置换杂凑算法的构造和安全性分析
THE CONSTRUCTION AND SECURITY ANALYSIS OF HASH ALGORITHM BASED ON STRONG ONE-WAY PERMUTATION
-
摘要: 本文利用n上单向置换与完善置换的复合,构造基于强单向置换的杂凑算法,并证明了该算法的安全性等价于单向置换在多项式时间内不可求逆.
-
关键词:
- 单向置换; 完善置换; 强单向置换
Abstract: This paper constructs the Hash algorithm based on strong one-way permutation by the composition of one-way permutation and perfect permutation on n and proves that its security is equivalent to the one-way permutation that can not be inversed in polynomial time. -
Pieprzyk J, Sadeghiyan B. Design of Hashing Algorithm. Berlin Heidelberg: Springer-Verlag, 1993: 132-169.[2]Webster A F.[J].Tavares S E. On The Design of S-Boxes. Advances in Cryptology-CRYPTO85, Santa Barbara: 1985, Berlin Heidelberg: Springer-Verlag.1986,:-[3]Preneel B, Govaerts R, Bandewalle J. Information Authentication: Hash Functions and Digital Signatures. Computer Security and Industrial Cryptology, State of the EAST curse, Leuven 1991, Berlin Heidelberg: Springer-Verlag, 1993: 88-130.X Lai; Massey J L. Hash Function Based on Block Ciphers. Advances in Cryptology-EUROCRYPT92. Balatonfured: 1992, Berlin Heidelberg: Springer-Verlag, 1993, 50-70. -
计量
- 文章访问数: 2059
- HTML全文浏览量: 117
- PDF下载量: 411
- 被引次数: 0
下载:
