A construction of a cipher from a single pseudorandom permutation.
From MaRDI portal
Publication:1364898
DOI10.1007/s001459900025zbMath1053.94552OpenAlexW2064939672WikidataQ121597133 ScholiaQ121597133MaRDI QIDQ1364898
Publication date: 1997
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001459900025
Related Items (71)
How to build an ideal cipher: the indifferentiability of the Feistel construction ⋮ BBB Secure Nonce Based MAC Using Public Permutations ⋮ Separating invertible key derivations from non-invertible ones: sequential indifferentiability of 3-round Even-Mansour ⋮ Tweaking Even-Mansour Ciphers ⋮ Multi-key Security: The Even-Mansour Construction Revisited ⋮ The Iterated Random Permutation Problem with Applications to Cascade Encryption ⋮ The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC ⋮ Key recovery attacks on iterated Even-Mansour encryption schemes ⋮ Tweak-Length Extension for Tweakable Blockciphers ⋮ An improved affine equivalence algorithm for random permutations ⋮ Beyond quadratic speedups in quantum attacks on symmetric schemes ⋮ Post-quantum security of the Even-Mansour cipher ⋮ Connecting tweakable and multi-key blockcipher security ⋮ Efficient slide attacks ⋮ Cryptanalysis of the Full 8.5-Round REESSE3+ Block Cipher ⋮ Cryptanalysis of Round-Reduced $$\mathtt{LED}$$ ⋮ Tweakable Blockciphers with Asymptotically Optimal Security ⋮ Security analysis of Even-Mansour structure hash functions ⋮ Using Bernstein-Vazirani algorithm to attack block ciphers ⋮ Reflections on slide with a twist attacks ⋮ Improved key-recovery attacks on reduced-round WEM-8 ⋮ Partition and mix: generalizing the swap-or-not shuffle ⋮ Breaking symmetric cryptosystems using the offline distributed Grover-Meets-Simon algorithm ⋮ Quantum key recovery attacks on tweakable Even-Mansour ciphers ⋮ Block encryption of quantum messages ⋮ Cryptanalytic time-memory-data trade-offs for FX-constructions and the affine equivalence problem ⋮ Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls ⋮ Energy consumption of protected cryptographic hardware cores. An experimental study ⋮ A quantum related-key attack based on the Bernstein-Vazirani algorithm ⋮ Cryptanalysis of reduced round SPEEDY ⋮ Post-quantum security on the Lai-Massey scheme ⋮ Simpira v2: A Family of Efficient Permutations Using the AES Round Function ⋮ Layout graphs, random walks and the \(t\)-wise independence of SPN block ciphers ⋮ Quantum key-recovery attack on Feistel constructions: Bernstein-Vazirani meet Grover algorithm ⋮ BBB security for 5-round even-Mansour-based key-alternating Feistel ciphers ⋮ Better security-efficiency trade-offs in permutation-based two-party computation ⋮ Tight security for key-alternating ciphers with correlated sub-keys ⋮ Designing tweakable enciphering schemes using public permutations ⋮ Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules) ⋮ Quantum attacks on PRFs based on public random permutations ⋮ Provable security against generic attacks on stream ciphers ⋮ An efficient affine equivalence algorithm for multiple S-boxes and a structured affine layer ⋮ Output masking of tweakable Even-Mansour can be eliminated for message authentication code ⋮ On the security of keyed hashing based on public permutations ⋮ Tight security analysis of 3-round key-alternating cipher with a single permutation ⋮ Just tweak! Asymptotically optimal security for the cascaded LRW1 tweakable blockcipher ⋮ Quantum key-length extension ⋮ Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses ⋮ WEM: A New Family of White-Box Block Ciphers Based on the Even-Mansour Construction ⋮ Tweakable block ciphers ⋮ Almost universal forgery attacks on AES-based MAC's ⋮ Strengthening the Known-Key Security Notion for Block Ciphers ⋮ Linear Analysis of Reduced-Round CubeHash ⋮ Minimizing the two-round Even-Mansour cipher ⋮ Generic attacks on the Lai-Massey scheme ⋮ Quick trickle permutation based on quick trickle characteristic sequence ⋮ Public-Seed Pseudorandom Permutations ⋮ Slidex attacks on the Even-Mansour encryption scheme ⋮ An observation on NORX, BLAKE2, and ChaCha ⋮ Hash Functions from Defective Ideal Ciphers ⋮ Pseudorandomness of Camellia-like scheme ⋮ Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model ⋮ Breaking Symmetric Cryptosystems Using Quantum Period Finding ⋮ Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security ⋮ XPX: Generalized Tweakable Even-Mansour with Improved Security Guarantees ⋮ The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3 ⋮ Multi-user BBB security of public permutations based MAC ⋮ More accurate results on the provable security of AES against impossible differential cryptanalysis ⋮ Quantum generic attacks on key-alternating Feistel ciphers for shorter keys ⋮ Improved BV-based quantum attack on block ciphers ⋮ Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts
Cites Work
This page was built for publication: A construction of a cipher from a single pseudorandom permutation.
