Practical Low Data-Complexity Subspace-Trail Cryptanalysis of Round-Reduced PRINCE

DOI10.1007/978-3-319-49890-4_18zbMath1411.94064OpenAlexW2552664347MaRDI QIDQ3179493

Christian Rechberger, Lorenzo Grassi

Publication date: 21 December 2016

Published in: Progress in Cryptology – INDOCRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://orbit.dtu.dk/en/publications/27e8cdd0-efc3-4168-b8af-061b4104e3c9

zbMATH Keywords

truncated differential attackPRINCEpractical attackinvariant subspace attackMANTISsubspace trails cryptanalysis

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

A new non-random property of 4.5-round PRINCE ⋮ PRINCEv2. More security for (almost) no overhead ⋮ Practical Low Data-Complexity Subspace-Trail Cryptanalysis of Round-Reduced PRINCE

Uses Software

• PRINCE
• SKINNY
• Midori
• QARMA

Cites Work

• Unnamed Item
• The effects of the omission of last round's MixColumns on AES
• Reflection cryptanalysis of PRINCE-like ciphers
• Midori: A Block Cipher for Low Energy
• The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
• Meet-in-the-Middle Attacks and Structural Analysis of Round-Reduced PRINCE
• A Generic Approach to Invariant Subspace Attacks: Cryptanalysis of Robin, iSCREAM and Zorro
• Universal Forgery and Key Recovery Attacks on ELmD Authenticated Encryption Algorithm
• Low-Data Complexity Attacks on AES
• Practical Low Data-Complexity Subspace-Trail Cryptanalysis of Round-Reduced PRINCE
• How to Protect DES Against Exhaustive Key Search
• PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications
• A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack

This page was built for publication: Practical Low Data-Complexity Subspace-Trail Cryptanalysis of Round-Reduced PRINCE