Paper 2024/1743
The Window Heuristic: Automating Differential Trail Search in ARX Ciphers with Partial Linearization Trade-offs
Abstract
The search for optimal differential trails for ARX ciphers is known to be difficult and scale poorly as the word size (and the branching through the carries of modular additions) increases.To overcome this problem, one may approximate the modular addition with the XOR operation, a process called linearization. The immediate drawback of this approach is that many valid and good trails are discarded. In this work, we explore different partial linearization trade-offs to model the modular addition through the \emph{window heuristic}, which restricts carry propagation to windows of
Metadata
- Available format(s)
-
PDF
- Category
- Attacks and cryptanalysis
- Publication info
- Preprint.
- Keywords
- arxautomated toolssatmilpheuristicdifferential
- Contact author(s)
-
emanuele bellini @ tii ae
david gerault @ tii ae
juan grados @ tii ae
thomas peyrin @ ntu edu sg - History
- 2024-10-28: approved
- 2024-10-25: received
- See all versions
- Short URL
- https://ia.cr/2024/1743
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1743, author = {Emanuele Bellini and David GERAULT and Juan Grados and Thomas Peyrin}, title = {The Window Heuristic: Automating Differential Trail Search in {ARX} Ciphers with Partial Linearization Trade-offs}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/1743}, year = {2024}, url = {https://eprint.iacr.org/2024/1743} }