Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
From MaRDI portal
Publication:2894400
DOI10.1007/978-3-642-29011-4_5zbMath1290.94044OpenAlexW1744216657MaRDI QIDQ2894400
John P. Steinberger, Gregor Leander, Elmar Tischhauser, Andrey Bogdanov, Lars R. Knudsen, François-Xavier Standaert
Publication date: 29 June 2012
Published in: Advances in Cryptology – EUROCRYPT 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29011-4_5
Related Items (38)
How to build an ideal cipher: the indifferentiability of the Feistel construction ⋮ Optimum attack on 3-round Feistel-2 structure ⋮ On the resilience of Even-Mansour to invariant permutations ⋮ BBB Secure Nonce Based MAC Using Public Permutations ⋮ Towards tight security of cascaded LRW2 ⋮ The \(t\)-wise independence of substitution-permutation networks ⋮ Separating invertible key derivations from non-invertible ones: sequential indifferentiability of 3-round Even-Mansour ⋮ Tweaking Even-Mansour Ciphers ⋮ Key recovery attacks on iterated Even-Mansour encryption schemes ⋮ Connecting tweakable and multi-key blockcipher security ⋮ Cryptanalysis of Round-Reduced $$\mathtt{LED}$$ ⋮ Tweakable Blockciphers with Asymptotically Optimal Security ⋮ Towards Understanding the Known-Key Security of Block Ciphers ⋮ Security analysis of Even-Mansour structure hash functions ⋮ Keyed sum of permutations: a simpler RP-based PRF ⋮ Tight security of cascaded LRW2 ⋮ Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls ⋮ Salvaging Weak Security Bounds for Blockcipher-Based Constructions ⋮ A modular approach to the security analysis of two-permutation constructions ⋮ Layout graphs, random walks and the \(t\)-wise independence of SPN block ciphers ⋮ Tight security for key-alternating ciphers with correlated sub-keys ⋮ Provably secure reflection ciphers ⋮ 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 ⋮ Minimizing the two-round tweakable Even-Mansour cipher ⋮ Tight security analysis of 3-round key-alternating cipher with a single permutation ⋮ AKF: a key alternating Feistel scheme for lightweight cipher designs ⋮ Strengthening the Known-Key Security Notion for Block Ciphers ⋮ Improving the security and efficiency of block ciphers based on LS-designs ⋮ On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks ⋮ Minimizing the two-round Even-Mansour cipher ⋮ Generic attacks on the Lai-Massey scheme ⋮ The Multi-user Security of Double Encryption ⋮ Slidex attacks on the Even-Mansour encryption scheme ⋮ Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security ⋮ XPX: Generalized Tweakable Even-Mansour with Improved Security Guarantees
Uses Software
This page was built for publication: Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
