基于強(qiáng)單向置換雜湊算法的構(gòu)造和安全性分析
THE CONSTRUCTION AND SECURITY ANALYSIS OF HASH ALGORITHM BASED ON STRONG ONE-WAY PERMUTATION
-
摘要: 本文利用n上單向置換與完善置換的復(fù)合,構(gòu)造基于強(qiáng)單向置換的雜湊算法,并證明了該算法的安全性等價(jià)于單向置換在多項(xiàng)式時(shí)間內(nèi)不可求逆.
-
關(guān)鍵詞:
- 單向置換; 完善置換; 強(qiáng)單向置換
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. -
計(jì)量
- 文章訪(fǎng)問(wèn)數(shù): 2073
- HTML全文瀏覽量: 120
- PDF下載量: 411
- 被引次數(shù): 0