Constructing pseudo-random permutations with a prescribed structure
From MaRDI portal
Recommendations
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)