Differential-linear cryptanalysis from an algebraic perspective
From MaRDI portal
The authors study differential-linear cryptanalysis from an algebraic perspective. They develop techniques for estimating the differential-linear bias and techniques for key recovery in differential-linear cryptanalysis. As an illustration, they apply it to several symmetric cryptosystems like Ascon and Serpent, versions of Grain. The theoretical estimates of the bias are equal to or close to their experimental results.
Cites work
- \textsc{Ascon} v1.2: lightweight authenticated encryption and hashing
- A Differential-Linear Attack on 12-Round Serpent
- A methodology for differential-linear cryptanalysis and its applications
- A methodology for differential-linear cryptanalysis and its applications (extended abstract)
- An AEAD variant of the Grain stream cipher
- Conditional differential cryptanalysis of 105 round Grain v1
- Conditional differential cryptanalysis of NLFSR-based cryptosystems
- Cryptanalysis of Ascon
- Differential-linear cryptanalysis from an algebraic perspective
- Differential-linear cryptanalysis of Serpent.
- Differential-linear cryptanalysis revisited
- Differential-multiple linear cryptanalysis
- DLCT: a new tool for differential-linear cryptanalysis
- Enhancing Differential-Linear Cryptanalysis
- Fast correlation attack revisited -- cryptanalysis on full Grain-128a, Grain-128, and Grain-v1
- Filtered nonlinear cryptanalysis of reduced-round serpent, and the wrong-key randomization hypothesis
- Grain-128AEADv2: strengthening the initialization against key reconstruction
- scientific article; zbMATH DE number 503238 (Why is no real title available?)
- scientific article; zbMATH DE number 1024056 (Why is no real title available?)
- scientific article; zbMATH DE number 1394292 (Why is no real title available?)
- scientific article; zbMATH DE number 1406763 (Why is no real title available?)
- Improved differential-linear attacks with applications to ARX ciphers
- Improved differential-linear cryptanalysis of 7-round Chaskey with partitioning
- Improving key-recovery in linear attacks: application to 28-round PRESENT
- Improving linear key recovery attacks using Walsh spectrum puncturing
- Improving the Time Complexity of Matsui’s Linear Cryptanalysis
- Linear Cryptanalysis of Reduced Round Serpent
- Massive superpoly recovery with nested monomial predictions
- Modeling for three-subset division property without unknown subset
- New attacks from old distinguishers improved attacks on serpent
- On probability of success in linear and differential cryptanalysis
- Revisiting higher-order differential-linear attacks from an algebraic perspective
- Some insights into differential cryptanalysis of Grain v1
- Stretching cube attacks: improved methods to recover massive superpolies
Cited in
(1)
This page was built for publication: Differential-linear cryptanalysis from an algebraic perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6883134)