Constructing pseudo-random permutations with a prescribed structure

DOI10.1007/S00145-001-0008-5MaRDI QIDQ1601828zbMATH OpenOpenAlexFDO

Authors Moni Naor, Omer Reingold

Publication date 27 June 2002

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00145-001-0008-5

zbMATH Keywords

block cipherscyclic permutationspseudorandom permutations

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Review text

Pseudorandom permutations have been introduced by \textit{M. Luby} and \textit{C. Rackoff} [SIAM J. Comput. 17, 373-386 (1988; Zbl 0644.94018)] as a formalization of block ciphers. They also showed how to construct such families of permutations that are indistinguishable from a random permutation. Here in the article, a further step is taken that shows how to construct pseudo-random permutations that satisfy a certain cycle restriction. It should be noted, however, that the construction works only for a fixed cycle type, and it is an open question whether this restriction can be removed.

Recommendations

• Constructing pseudo-random permutations with a prescribed structure
• Publication:3359634
• On the construction of pseudorandom permutations: Luby-Rackoff revisited
• scientific article; zbMATH DE number 697813
• scientific article; zbMATH DE number 1559534

Cited in

(12)

• Efficient computation of the iteration of functions
• Targeted ciphers for format-preserving encryption
• Hardness-preserving reductions via cuckoo hashing
• Constructing pseudo-random permutations with a prescribed structure
• Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
• Luby-Rackoff Ciphers from Weak Round Functions?
• Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation
• THE CONJUGACY PROBLEM AND RELATED PROBLEMS IN LATTICE-ORDERED GROUPS
• Tweakable Pseudorandom Permutation from Generalized Feistel Structure
• Targeted invertible pseudorandom functions and deterministic format-transforming encryption
• Breaking the IEEE encryption standard XCB-AES in two queries
• Decompositions of graphs of functions and fast iterations of lookup tables

This page was built for publication: Constructing pseudo-random permutations with a prescribed structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1601828)