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.
朱华飞; 肖国镇; 王新梅. 基于强单向置换杂凑算法的构造和安全性分析[J]. 电子与信息学报, 1997, 19(6): 810-813 .
Zhu Huafei; Xiao Guozhen; Wang Xinmei. THE CONSTRUCTION AND SECURITY ANALYSIS OF HASH ALGORITHM BASED ON STRONG ONE-WAY PERMUTATION. , 1997, 19(6): 810-813 .