On perfect linear approximations and differentials over two-round SPNs

DOI10.1007/978-3-031-38548-3_8OpenAlexW4385654073MaRDI QIDQ6145946

Patrick Neumann, Gregor Leander, Lukas Stennes, Christof Beierle, Patrick Felke

Publication date: 2 February 2024

Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-38548-3_8

zbMATH Keywords

decompositiondifferential cryptanalysislinear cryptanalysisweak keysboomerang connectivity table

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Boomerang Connectivity Table: a new cryptanalysis tool
• Provable security against a differential attack
• \textsc{Ascon} v1.2: lightweight authenticated encryption and hashing
• The MALICIOUS framework: embedding backdoors into tweakable block ciphers
• The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
• Block Ciphers – Focus on the Linear Layer (feat. PRIDE)
• The Wide Trail Design Strategy
• Boolean Functions for Cryptography and Coding Theory
• Block cipher invariants as eigenvectors of correlation matrices
• Efficient detection of high probability statistical properties of cryptosystems via surrogate differentiation
• Pitfalls and shortcomings for decompositions and alignment
• Differential cryptanalysis in the fixed-key model
• Constructing and deconstructing intentional weaknesses in symmetric ciphers
• Weak subtweakeys in SKINNY

This page was built for publication: On perfect linear approximations and differentials over two-round SPNs