Differential-linear approximation semi-unconstrained searching and partition tree: application to LEA and Speck
From MaRDI portal
Publication:6595814
DOI10.1007/978-981-99-8727-6_8zbMATH Open1546.94062MaRDI QIDQ6595814
Yi Chen, Hongbo Yu, Zhenzhen Bao
Publication date: 30 August 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- DLCT: a new tool for differential-linear cryptanalysis
- Differential-linear cryptanalysis revisited
- On probability of success in linear and differential cryptanalysis
- An Improvement of Linear Cryptanalysis with Addition Operations with Applications to FEAL-8X
- Improved Differential Cryptanalysis of Round-Reduced Speck
- Chaskey: An Efficient MAC Algorithm for 32-bit Microcontrollers
- Automatic Differential Analysis of ARX Block Ciphers with Application to SPECK and LEA
- Improved Differential-Linear Cryptanalysis of 7-Round Chaskey with Partitioning
- Automatic Search of Linear Trails in ARX with Applications to SPECK and Chaskey
- Automatic Security Evaluation and (Related-key) Differential Characteristic Search: Application to SIMON, PRESENT, LBlock, DES(L) and Other Bit-Oriented Block Ciphers
- The Simon and Speck Block Ciphers on AVR 8-Bit Microcontrollers
- New Features of Latin Dances: Analysis of Salsa, ChaCha, and Rumba
- Enhancing Differential-Linear Cryptanalysis
- Differential and Linear Cryptanalysis Using Mixed-Integer Linear Programming
- Boolean Functions for Cryptography and Coding Theory
- Advances in Cryptology – CRYPTO 2004
- A Differential-Linear Attack on 12-Round Serpent
- Improved differential-linear attacks with applications to ARX ciphers
- Improved differential-linear attacks with applications to ARX ciphers
- Fully automated differential-linear attacks against ARX ciphers
- Rotational differential-linear distinguishers of ARX ciphers with arbitrary output linear masks
This page was built for publication: Differential-linear approximation semi-unconstrained searching and partition tree: application to LEA and Speck
