How to construct pseudorandom and super pseudorandom permutations from one single pseudorandom function
作者： Jacques Patarin
关键词: Pseudorandom function family 、 Pseudorandom permutation 、 Pseudorandom generator theorem 、 Discrete mathematics 、 Pseudorandom generators for polynomials 、 Mathematics 、 Pseudorandom generator 、 Pseudorandomness 、 Pseudorandom number generator 、 Arithmetic 、 Permutation
摘要: … permutation generator with a single pseudorandom function. This will solve an open … bit, is a pseudorandom function generator and is a super pseudorandom function generator. Here …
springer.com
sci-hub.st 参考文章(7)
Josef Pieprzyk, How to construct pseudorandom permutations from single pseudorandom functions theory and application of cryptographic techniques. pp. 140- 150 ,(1991) , 10.1007/3-540-46877-3_12
Babak Sadeghiyan, Josef Pieprzyk, On Necessary and Sufficient Conditions for the Construction of Super Pseudorandom Permutations international cryptology conference. pp. 194- 209 ,(1991) , 10.1007/3-540-57332-1_16
Hideki Imai, Tsutomu Matsumoto, Yuliang Zheng, Impossibility and optimally results on constructing pseudorandom permutations (extended abstract) theory and application of cryptographic techniques. pp. 412- 422 ,(1990)
Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai, Impossibility and Optimality Results on Constructing Pseudorandom Permutations theory and application of cryptographic techniques. pp. 412- 422 ,(1989) , 10.1007/3-540-46885-4_41
Jacques Patarin, New Results on Pseudorandom Permutation Generators Based on the DES Scheme international cryptology conference. pp. 301- 312 ,(1991) , 10.1007/3-540-46766-1_25
L. Paige, Complete mappings of finite groups Pacific Journal of Mathematics. ,vol. 1, pp. 111- 116 ,(1951) , 10.2140/PJM.1951.1.111
Michael Luby, Charles Rackoff, How to construct pseudorandom permutations from pseudorandom functions SIAM Journal on Computing. ,vol. 17, pp. 373- 386 ,(1988) , 10.1137/0217022