基于强单向置换杂凑算法的构造和安全性分析

Download: PDF (695 KB)
Export: BibTeX | EndNote (RIS)

Abstract This paper constructs the Hash algorithm based on strong one-way permutation by the composition of one-way permutation and perfect permutation on ∑ⁿ and proves that its security is equivalent to the one-way permutation that can not be inversed in polynomial time.

Key words： One-way permutation Perfect permutation Strong one-way permutation

Received: 05 February 1996

PACS:

TN918.1

	Service

	E-mail this article
	Add to my bookshelf
	Add to citation manager
	E-mail Alert
	RSS
	Articles by authors



	Zhu Huafei
	Xiao Guozhen
	Wang Xinmei

Cite this article:

Zhu Huafei,Xiao Guozhen,Wang Xinmei. THE CONSTRUCTION AND SECURITY ANALYSIS OF HASH ALGORITHM BASED ON STRONG ONE-WAY PERMUTATION[J]. , 1997, 19(6): 810-813 .

URL:

http://jeit.ie.ac.cn/EN/ OR http://jeit.ie.ac.cn/EN/Y1997/V19/I6/810

[1]	WANG Shang-Ping, Bai Yue, Liu Li-Hua, Chen Juan-Juan. Strong Designated Verifier Signature Scheme from Multivariate Public Key Cryptosystems[J]. , 2014, 36(10): 2331-2335.