Symmetric Cryptanalysis I
summary
Graph-based automation recovers Trivium superpoly structure using a localized MILP with 12 pruning patterns and a nested solve framework that pushes solvable rounds from 841 to 843 under 94 GB RAM, pruning 6,956 trails and improving pruning-effectiveness (PTCR) by 7–10×. A second system fully automates differential-linear search for ARX ciphers using MILP + MIQCP, returning better SPECK32/64 distinguishers (9r: 2^-7.3 vs 2^-8.93; 11r: 2^-16 with 2^29 complexity) and reducing complexities for 13–14 rounds.
AI-written summary · about
chapters (11)
- 0:00Introduction
- 2:03Cube attacks overview
- 8:02Pruning patterns in Trivium
- 12:29Nested graph-based model
- 14:55Summary of improvements
- 15:16Differential-linear attacks intro
- 23:25Automating distinguisher search
- 28:12Correlation computation
- 30:41Results on Speck cipher
- 31:02Conclusions and future work
- 31:44Q&A
