摘要
PKCS 复杂性的系统讨论,相继发表 PKCS 的破译问题浅介;PKCS 的约定问题浅介,本文就 PKCS 的复杂性度量中的计算方法问题作个浅介,以求对 PKCS 系统的复杂性有个较为全面的认识,文中在定义单向函数的基础上,讨论了计算方法中有关定理、命题和推论,以及从计算的目的出发进一步讨论了 PKCS 的殆遍复杂性.
The system discussion of complexity for PKCS,cracking problem and conventional problem for PKCS have been studied.The paper gives an elementary introduction to computational approach complexity measure for PKCS in order to have a complete under- standing of the complexity,and by the one-way functions it discusses the relevant theo- rem,corollary and proposition of computational approach for PKCS,finally goes fur- ther into the almost-everywhere complexity for PKCS.
关键词
PKCS
复杂性
单向函数
计算方法
函数发生器
complexity for PKCS
one-way functions
accepting computation
almost-everywhere complexity
