How to Construct Pseudorandom and Super Pseudorandom Permutations from One Single Pseudorandom Function-Reference-Cited by-同舟云学术

How to Construct Pseudorandom and Super Pseudorandom Permutations from One Single Pseudorandom Function

Published: Issue: Volume: Page:256-266
ISSN:
Container-title:Advances in Cryptology — EUROCRYPT’ 92
language:
Short-container-title:

Author:

Patarin Jacques

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-47555-9_22.pdf

Reference7 articles.

1. M. Luby and C. Rackoff, How to construct pseudorandom permutations from pseudorandom functions, SIAM Journal and Computing, 17(2): 373–386, April 1988.

2. J. Patarin, New results on pseudorandom permutation generators based on the DES Scheme, Abstracts of Crypto’91, p. 7–2, 7–7.

3. J. Patarin, Etude des générateurs de permutations basés sut le schéma du DES, Thèse, November 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. B. Sadeghiyan and J. Pieprzyk, On necessary and sufficient conditions for the construction of super pseudorandom permutations, Abstracts of Asiacrypt’91, November 1991, p. 117–123.

Cited by 36 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Feistel Ciphers Based on a Single Primitive;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2024-08-01

2. Feistel Ciphers Based on a Single Primitive;Cryptography and Coding;2023-12-04

3. BBB security for 5-round even-Mansour-based key-alternating Feistel ciphers;Designs, Codes and Cryptography;2023-10-04

4. Symmetric searchable encryption scheme that supports phrase search;Microsystem Technologies;2019-06-24

5. Revisiting Key-Alternating Feistel Ciphers for Shorter Keys and Multi-user Security;Lecture Notes in Computer Science;2018