Analyzing permutations for AES-like ciphers: understanding shiftrows

DOI10.1007/978-3-319-16715-2_3MaRDI QIDQ2790029zbMATH OpenOpenAlexFDO

Authors Christof Beierle, Philipp Jovanovic, Martin M. Lauridsen, Gregor Leander, Christian Rechberger

Publication date 2 March 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-16715-2_3

zbMATH Keywords

optimizationdiffusiondifferential cryptanalysislinear cryptanalysisAESmixed-integer linear programmingAES-like

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Diffusion rates of linear medium in AES-like ciphers
• Proving the Security of AES Substitution-Permutation Network
• Improved cryptanalysis of AES-like permutations
• Variants of the AES key schedule for better truncated differential bounds
• On mixing linear transforms for block ciphers

Cites work

• 3D: A Three-Dimensional Block Cipher
• Communication Theory of Secrecy Systems*
• Differential and Linear Cryptanalysis Using Mixed-Integer Linear Programming
• PRINCE -- a low-latency block cipher for pervasive computing applications. Extended abstract
• The LED block cipher
• The PHOTON family of lightweight hash functions
• The block cipher \textsc{Square}

Cited in

(2)

• Upper bound of the length of truncated impossible differentials for AES
• Pen and Paper Arguments for SIMON and SIMON-like Designs

Describes a project that uses

Uses Software

• LED
• mCrypton
• CPLEX

This page was built for publication: Analyzing permutations for AES-like ciphers: understanding shiftrows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2790029)