Minimizing the two-round Even-Mansour cipher
type: Item
instance of: scholarly article
title: Minimizing the two-round Even-Mansour cipher
zbMATH Open document ID: 1442.94033
author: Shan Chen
author: Rodolphe Lampe
author: Jooyoung Lee
author: Yannick Seurin
author: John P. Steinberger
published in: Journal of Cryptology
publication date: 2018-11-01T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6970573
zbMATH Keywords: generalized Even-Mansour cipher
zbMATH Keywords: key-alternating cipher
zbMATH Keywords: indistinguishability
zbMATH Keywords: pseudorandom permutation
zbMATH Keywords: random permutation model
zbMATH Keywords: sum-capture problem
describes a project that uses: PRESENT
describes a project that uses: FOX
describes a project that uses: LED
MaRDI profile type: Publication
full work available at URL: s00145-018-9295-y
OpenAlex ID: W2803828316
Wikidata QID: Q121803205
cites work: On the Indifferentiability of Key-Alternating Ciphers
cites work: Testing Triangle-Freeness in General Graphs
cites work: PRESENT: An Ultra-Lightweight Block Cipher
cites work: Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
cites work: Q4941816
cites work: Q3374941
cites work: Tight Security Bounds for Key-Alternating Ciphers
cites work: Limitations of the Even-Mansour construction
cites work: Key Recovery Attacks on 3-round Even-Mansour, 8-step LED-128, and Full AES2
cites work: Cryptanalysis of Iterated Even-Mansour Schemes with Two Keys
cites work: Minimalism in Cryptography: The Even-Mansour Scheme Revisited
cites work: Q2760977
cites work: A construction of a cipher from a single pseudorandom permutation.
cites work: Plain versus Randomized Cascading-Based Key-Length Extension for Block Ciphers
cites work: Q2712110
cites work: The LED Block Cipher
cites work: Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading
cites work: Selected Areas in Cryptography
cites work: Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions
cites work: How to protect DES against exhaustive key search (an analysis of DESX).
cites work: Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption
cites work: Q4036895
cites work: An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher
cites work: How to Construct an Ideal Cipher from a Small Set of Public Permutations
cites work: Block substitutions using orthomorphic mappings
cites work: Cryptanalysis of Round-Reduced $$\mathtt{LED}$$
cites work: The “Coefficients H” Technique
cites work: Q4502479
DOI: 10.1007/S00145-018-9295-Y
description: scientific article; zbMATH DE number 6970573