Impossible differential cryptanalysis on reduced-round PRINCEcore

DOI10.1007/978-3-031-29371-9_4OpenAlexW4361860012MaRDI QIDQ6176049

No author found.

Publication date: 21 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-29371-9_4

zbMATH Keywords

S-boxdistinguisherlightweight cryptographyPRINCEimpossible differentials

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer security (68M25)

Cites Work

• Unnamed Item
• Unnamed Item
• Upper bound of the length of truncated impossible differentials for AES
• More accurate results on the provable security of AES against impossible differential cryptanalysis
• Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms — Design andAnalysis
• Midori: A Block Cipher for Low Energy
• Reflection Cryptanalysis of PRINCE-Like Ciphers
• Security Analysis of PRINCE
• LBlock: A Lightweight Block Cipher
• Links Among Impossible Differential, Integral and Zero Correlation Linear Cryptanalysis
• PRESENT: An Ultra-Lightweight Block Cipher
• Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
• PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications
• How to protect DES against exhaustive key search (an analysis of DESX).

This page was built for publication: Impossible differential cryptanalysis on reduced-round PRINCEcore