Indifferentiability of iterated Even-Mansour ciphers with non-idealized key-schedules: five rounds are necessary and sufficient
From MaRDI portal
Publication:1675219
DOI10.1007/978-3-319-63697-9_18zbMath1418.94043OpenAlexW2739825077MaRDI QIDQ1675219
Yuanxi Dai, Aishwarya Thiruvengadam, Yannick Seurin, John P. Steinberger
Publication date: 27 October 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-63697-9_18
Related Items (12)
KHAPE: Asymmetric PAKE from key-hiding key exchange ⋮ Asymmetric PAKE with low computation \textit{and} communication ⋮ Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls ⋮ Randomized half-ideal cipher on groups with applications to UC (a)PAKE ⋮ Layout graphs, random walks and the \(t\)-wise independence of SPN block ciphers ⋮ Batching base oblivious transfers ⋮ Sequential indifferentiability of confusion-diffusion networks ⋮ Designing tweakable enciphering schemes using public permutations ⋮ Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules) ⋮ Tight security analysis of 3-round key-alternating cipher with a single permutation ⋮ Just tweak! Asymptotically optimal security for the cascaded LRW1 tweakable blockcipher ⋮ Improved indifferentiability security proof for 3-round tweakable Luby-Rackoff
This page was built for publication: Indifferentiability of iterated Even-Mansour ciphers with non-idealized key-schedules: five rounds are necessary and sufficient
