How to Construct an Ideal Cipher from a Small Set of Public Permutations
From MaRDI portal
Publication:2867234
DOI10.1007/978-3-642-42033-7_23zbMath1327.94063OpenAlexW2131642892MaRDI QIDQ2867234
Rodolphe Lampe, Yannick Seurin
Publication date: 10 December 2013
Published in: Advances in Cryptology - ASIACRYPT 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-42033-7_23
Related Items (15)
How to build an ideal cipher: the indifferentiability of the Feistel construction ⋮ 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 ⋮ Indifferentiability of the confusion-diffusion network and the cascade block cipher ⋮ Improved domain extender for the ideal cipher ⋮ Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls ⋮ Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules) ⋮ Just tweak! Asymptotically optimal security for the cascaded LRW1 tweakable blockcipher ⋮ Strengthening the Known-Key Security Notion for Block Ciphers ⋮ Minimizing the two-round Even-Mansour cipher ⋮ Slidex attacks on the Even-Mansour encryption scheme ⋮ XPX: Generalized Tweakable Even-Mansour with Improved Security Guarantees ⋮ Indifferentiability of 8-Round Feistel Networks
This page was built for publication: How to Construct an Ideal Cipher from a Small Set of Public Permutations
