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

cyclic permutationsblock cipherspseudorandom permutations

Mathematics Subject Classification ID

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

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

(11)

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

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)