What is the effective key length for a block cipher: an attack on every practical block cipher

DOI10.1007/s11432-014-5096-6zbMath1357.94068OpenAlexW2071636004WikidataQ123331092 ScholiaQ123331092MaRDI QIDQ893734

Xuejia Lai, Jia-lin Huang

Publication date: 20 November 2015

Published in: Science China. Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-014-5096-6

zbMATH Keywords

block ciphermeet-in-the-middlebrute-force attackeffective key bits

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Improvements to quantum search techniques for block-ciphers, with applications to AES

Uses Software

• ARIA
• PRESENT
• HIGHT
• Camellia
• KTANTAN
• KATAN
• MISTY
• XTEA

Cites Work

• Unnamed Item
• Practical security against linear cryptanalysis for SMS4-like ciphers with SP round function
• Security of the SMS4 block cipher against differential cryptanalysis
• Differential attack on five rounds of the SC2000 block cipher
• Narrow-Bicliques: Cryptanalysis of Full IDEA
• A 3-Subset Meet-in-the-Middle Attack: Cryptanalysis of the Lightweight Block Cipher KTANTAN
• Biclique Cryptanalysis of the Full AES
• Piccolo: An Ultra-Lightweight Blockcipher
• HIGHT: A New Block Cipher Suitable for Low-Resource Device
• PRESENT: An Ultra-Lightweight Block Cipher
• 256 Bit Standardized Crypto for 650 GE – GOST Revisited
• KATAN and KTANTAN — A Family of Small and Efficient Hardware-Oriented Block Ciphers
• Markov Ciphers and Differential Cryptanalysis
• New block encryption algorithm MISTY
• Improved Attacks on Full GOST
• Information Security and Cryptology - ICISC 2003