Kalai , gil . " a subexponential randomized simplex algorithm ( extended abstract ) . " in proceedings of the 24th annual association for computing machinery symposium on theory of computing . new york , ny : acm press , 1992 一种亚指数随机化的简单型法(扩展摘要) , 《第24届计算理论的机器计算年会公报》 ,纽约, ny : acm出版, 1992 。
1 luby m , rackoff c . how to construct pseudorandom permutations from pseudorandom functions . siam journal on computing , 1988 , 17 : 373 - 386 . a preliminary version including other results appeared in proceedings of the 18th acm symposium on theory of computing , 1986 , pp . 356 - 363 可证明安全理论在分组密码中的研究始于luby和rackoff对des的工作,他们形式化地描述了分组密码的密码特性,依据不同的攻击,定义了伪随机置换和超伪随机置换的概念。