Pitfalls and shortcomings for decompositions and alignment
From MaRDI portal
Publication:6083133
DOI10.1007/978-3-031-30634-1_11zbMath1528.94064OpenAlexW4365807701MaRDI QIDQ6083133
Gregor Leander, Patrick Neumann, Baptiste Lambin
Publication date: 8 December 2023
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-30634-1_11
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Switchings, extensions, and reductions in central digraphs
- Proving resistance against invariant attacks: how to choose the round constants
- Improving key-recovery in linear attacks: application to 28-round PRESENT
- Thinking outside the superbox
- Key-Recovery Attacks on ASASA
- Automatic Differential Analysis of ARX Block Ciphers with Application to SPECK and LEA
- On Linear Hulls, Statistical Saturation Attacks, PRESENT and a Cryptanalysis of PUFFIN
- PRESENT: An Ultra-Lightweight Block Cipher
- Keccak
- The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants
- PRESENT Runs Fast
- Boolean Functions for Cryptography and Coding Theory
- DEFAULT: cipher level resistance against differential fault attack
This page was built for publication: Pitfalls and shortcomings for decompositions and alignment