摘要
本文利用Σ＾ｎ上单向置换与完善置换的复合，构造基于强单向转换的杂凑算法，并证明了该算法的安全性等价于单向置换在多项式时间内不可求逆。
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.
基金
国家自然科学基金
关键词
单向置换
完善置换
强单片置换
保密通信
One-way permutation, Perfect permutation, Strong one-way permutation
