Minimizing the two-round Even-Mansour cipher

DOI10.1007/s00145-018-9295-yzbMath1442.94033OpenAlexW2803828316WikidataQ121803205 ScholiaQ121803205MaRDI QIDQ1994640

John P. Steinberger, Yannick Seurin, Jooyoung Lee, Shan Chen, Rodolphe Lampe

Publication date: 1 November 2018

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-018-9295-y

zbMATH Keywords

indistinguishabilityrandom permutation modelkey-alternating cipherpseudorandom permutationgeneralized Even-Mansour ciphersum-capture problem

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Beyond-birthday security for permutation-based Feistel networks ⋮ Keyed sum of permutations: a simpler RP-based PRF ⋮ Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules) ⋮ Tight security analysis of 3-round key-alternating cipher with a single permutation

Uses Software

• PRESENT
• FOX
• LED

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A construction of a cipher from a single pseudorandom permutation.
• Block substitutions using orthomorphic mappings
• On the Indifferentiability of Key-Alternating Ciphers
• Plain versus Randomized Cascading-Based Key-Length Extension for Block Ciphers
• Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions
• Key Recovery Attacks on 3-round Even-Mansour, 8-step LED-128, and Full AES2
• How to Construct an Ideal Cipher from a Small Set of Public Permutations
• Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
• Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading
• Minimalism in Cryptography: The Even-Mansour Scheme Revisited
• Cryptanalysis of Iterated Even-Mansour Schemes with Two Keys
• Cryptanalysis of Round-Reduced $$\mathtt{LED}$$
• The LED Block Cipher
• PRESENT: An Ultra-Lightweight Block Cipher
• Testing Triangle-Freeness in General Graphs
• The “Coefficients H” Technique
• Limitations of the Even-Mansour construction
• An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher
• Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption
• Tight Security Bounds for Key-Alternating Ciphers
• Selected Areas in Cryptography
• How to protect DES against exhaustive key search (an analysis of DESX).

This page was built for publication: Minimizing the two-round Even-Mansour cipher