Cryptanalysis of Round-Reduced $$\mathtt{LED}$$

DOI10.1007/978-3-662-43933-3_7zbMath1321.94082OpenAlexW2262042547MaRDI QIDQ2946874

Ivica Nikolić, Shuang Wu, Lei Wang

Publication date: 18 September 2015

Published in: Fast Software Encryption (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43933-3_7

zbMATH Keywords

lightweightLEDmulticollisionchosen-key attacksingle-key attack

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Key recovery attacks on iterated Even-Mansour encryption schemes ⋮ Key alternating ciphers based on involutions ⋮ Minimizing the two-round Even-Mansour cipher ⋮ Quantum algorithm for the multicollision problem ⋮ Beyond conventional security in sponge-based authenticated encryption modes

Cites Work

• Unnamed Item
• A construction of a cipher from a single pseudorandom permutation.
• Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
• Minimalism in Cryptography: The Even-Mansour Scheme Revisited
• Security Analysis of the Lightweight Block Ciphers XTEA, LED and Piccolo
• A 3-Subset Meet-in-the-Middle Attack: Cryptanalysis of the Lightweight Block Cipher KTANTAN
• The LED Block Cipher
• Distinguisher and Related-Key Attack on the Full AES-256
• The Rebound Attack: Cryptanalysis of Reduced Whirlpool and Grøstl
• Super-Sbox Cryptanalysis: Improved Attacks for AES-Like Permutations
• Rebound Distinguishers: Results on the Full Whirlpool Compression Function
• Limitations of the Even-Mansour construction
• Algebraic Side-Channel Attacks Beyond the Hamming Weight Leakage Model
• Differential Analysis of the LED Block Cipher
• Birthday Paradox for Multi-collisions
• A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
• Topics in Cryptology – CT-RSA 2006

This page was built for publication: Cryptanalysis of Round-Reduced $$\mathtt{LED}$$