Bounding the length of impossible differentials for SPN block ciphers

DOI10.1007/s10623-021-00932-1zbMath1475.94173OpenAlexW3197965186WikidataQ122892980 ScholiaQ122892980MaRDI QIDQ2234462

Qian Wang, Chen-Hui Jin

Publication date: 19 October 2021

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-021-00932-1

zbMATH Keywords

system of linear equationsSPNimpossible differentialexpansion indexmaximally linearly independent setrowblock rank

Mathematics Subject Classification ID

Cryptography (94A60)

Uses Software

• ARIA
• mCrypton
• SKINNY
• Midori
• CRYPTON
• Minalpher

Cites Work

• Unnamed Item
• Unnamed Item
• A unified method for finding impossible differentials of block cipher structures
• Impossible differential cryptanalysis using matrix method
• Making the impossible possible
• Provable security against impossible differential and zero correlation linear cryptanalysis of some Feistel structures
• More accurate results on the provable security of AES against impossible differential cryptanalysis
• Midori: A Block Cipher for Low Energy
• Provable Security Evaluation of Structures Against Impossible Differential and Zero Correlation Linear Cryptanalysis
• The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
• Automatic Search of Truncated Impossible Differentials for Word-Oriented Block Ciphers
• Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
• New Impossible Differential Search Tool from Design and Cryptanalysis Aspects
• Information Security and Cryptology - ICISC 2003