Efficient and extensive search for precise linear approximations with high correlations of full SNOW-V
From MaRDI portal
Publication:2673990
DOI10.1007/s10623-022-01090-8zbMath1497.94134OpenAlexW4290068880WikidataQ114226817 ScholiaQ114226817MaRDI QIDQ2673990
Dengguo Feng, Bin Zhang, Zhaocun Zhou
Publication date: 22 September 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01090-8
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast correlation attacks on certain stream ciphers
- A fast correlation attack on LILI-128
- Fast correlation attack revisited -- cryptanalysis on full Grain-128a, Grain-128, and Grain-v1
- Fast computation of linear approximation over certain composition functions and applications to SNOW 2.0 and SNOW 3G
- Refinements of the k-tree Algorithm for the Generalized Birthday Problem
- Fast Correlation Attack Algorithm with List Decoding and an Application
- Fast Correlation Attacks over Extension Fields, Large-Unit Linear Approximation and Cryptanalysis of SNOW 2.0
- Improved Linear Distinguishers for SNOW 2.0
- A comparison of fast correlation attacks
- Fast Computation of Large Distributions and Its Cryptographic Applications
- Several MILP-Aided Attacks Against SNOW 2.0