On computational complexity of impossible differential cryptanalysis

DOI10.1016/j.ipl.2013.12.008zbMath1371.94655OpenAlexW2066597764MaRDI QIDQ2446068

Mohammad Dakhilalian, Mohsen Shakiba, Hamid Mala

Publication date: 15 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.12.008

zbMATH Keywords

computational complexitycryptographyblock cipherimpossible differential cryptanalysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Related Items (1)

Making the impossible possible

Uses Software

• Camellia
• FOX

Cites Work

• Unnamed Item
• Unnamed Item
• Differential cryptanalysis of DES-like cryptosystems
• Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms — Design andAnalysis
• New Impossible Differential Attacks on Camellia
• Improved Impossible Differential Cryptanalysis of 7-Round AES-128
• Impossible Differential Cryptanalysis of ARIA Reduced to 7 Rounds
• An Improved Impossible Differential Attack on MISTY1
• New Results on Impossible Differential Cryptanalysis of Reduced–Round Camellia–128
• Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
• New Observations on Impossible Differential Cryptanalysis of Reduced-Round Camellia
• Selected Areas in Cryptography
• New Impossible Differential Attacks on AES

This page was built for publication: On computational complexity of impossible differential cryptanalysis