Generic framework for key-guessing improvements

DOI10.1007/978-3-030-92062-3_16zbMath1514.94051OpenAlexW3204522355MaRDI QIDQ6157501

Federico Canale, María Naya-Plasencia, Gregor Leander, Antonio Flórez-Gutiérrez, Marek Broll

Publication date: 12 May 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-030-92062-3_16

zbMATH Keywords

cryptanalysisS-boxaffine decision treeskey-guessing

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Optimizing rectangle attacks: a unified and generic framework for key recovery ⋮ Optimising linear key recovery attacks with affine Walsh transform pruning ⋮ Quantum linear key-recovery attacks using the QFT

Cites Work

• Improved (related-key) differential cryptanalysis on GIFT
• Mind the gap -- a closer look at the security of block ciphers against differential cryptanalysis
• On the structure of Boolean functions with small spectral norm
• Improving key-recovery in linear attacks: application to 28-round PRESENT
• Sieve-in-the-Middle: Improved MITM Attacks
• Multiple Differential Cryptanalysis Using LLR and χ 2 Statistics
• PRESENT: An Ultra-Lightweight Block Cipher
• GIFT: A Small Present
• Analysis of Boolean Functions
• Improving the Time Complexity of Matsui’s Linear Cryptanalysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generic framework for key-guessing improvements