Analyzing Permutations for AES-like Ciphers: Understanding ShiftRows

DOI10.1007/978-3-319-16715-2_3zbMath1382.94060OpenAlexW266033272MaRDI QIDQ2790029

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

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

optimizationdiffusionmixed-integer linear programmingdifferential cryptanalysislinear cryptanalysisAESAES-like

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

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

Uses Software

• CPLEX
• mCrypton
• LED

Cites Work

• The LED Block Cipher
• Communication Theory of Secrecy Systems*
• The block cipher Square
• Differential and Linear Cryptanalysis Using Mixed-Integer Linear Programming
• PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications
• The PHOTON Family of Lightweight Hash Functions
• 3D: A Three-Dimensional Block Cipher

This page was built for publication: Analyzing Permutations for AES-like Ciphers: Understanding ShiftRows