New results on pseudorandom permutation generators based on the des scheme

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 576 LNCS, Issue , 1992, Pages 301-312

  Patarin, Jacques ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

NEW RESULTS; PSEUDORANDOM PERMUTATION; PSEUDORANDOMNESS; RANDOM FUNCTIONS; RANDOM PERMUTATIONS; S-BOXES;

CRYPTOGRAPHY;

EID: 85029478073     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46766-1_25     Document Type: Conference Paper

References (5)

1. M. Luby and Ch. Rackoff, How to construct pseudorandom permutations from pseudorandom functions, SIAM Journal and Computing, 17(2): 373-386, April 1988.
2. J. Patarin, Pseudorandom permutations based on the DES Scheme, Proceedings of EUROCODE’90.
3. J. Patarin, Etude des générateurs de permutations basés sur le Schéma du D.E.S., Thèse. To be publish in September 1991, INRIA, Domaine de Voluceau, Le Chesnay, France.
4. J. Pieprzyk, How to construct pseudorandom permutations from Single Pseudorandom Functions, EUROCRYPT’90, Århus, Denmark, May 1990.
5. Y. Zheng, T. Matsumoto and H. Imai, Impossibility and optimality results on constructing pseudorandom permutations, Abstract of EUROCRYPT’89, Houthalen, Belgium, April 1989.