Researchers Automated Cryptanalytic Divisibility Proofs
New computational models have identified higher divisibility properties in several major cryptographic algorithms.
Updated on Oct. 14, 2026 in Mathematics
Researchers have developed automated MILP/SAT models that significantly improve divisibility bounds for cryptographic ciphers. These tools utilize complete-round Walsh coefficients to identify properties that were previously undetectable.
Why it matters
The breakthrough addresses failures in existing trail-existence tests, which previously struggled to account for dependencies between output conditions and false zero-correlation claims.
The researchers employed automated MILP/SAT models alongside fast Walsh-Hadamard transforms to analyze complete-round Walsh coefficients. These methods established the first proofs of higher divisibility for 8-round SPECK and BEANIE ciphers.
The players
International Association for Cryptologic Research
This professional organization maintains the repository where the full cryptanalytic research paper was published.
The details
By utilizing two-way conversions, the models relate linear, integral, and differential-linear sums to provide explicit divisibility guarantees. The process successfully uncovered new properties across a diverse array of algorithms, including GIFT-64, Ascon, and SKINNY-64.
Timeline
October 14, 2026: Publication date of the research findings.
The Big Picture
This discovery marks a shift in how cryptanalysts approach cipher evaluation, moving from manual trail-existence tests toward rigorous, automated verification. It builds on the lineage of integral cryptanalysis by closing gaps where previous methods failed to verify dependencies.
The improvement of divisibility bounds helps developers and security auditors better predict the resilience of encryption algorithms against differential attacks. This strengthens the reliability of future cryptographic systems used in data protection and digital infrastructure.
The takeaway
These findings underscore the necessity of automated verification in modern cryptography to identify hidden mathematical vulnerabilities. Developers should leverage these new divisibility bounds to reassess the security margins of existing block ciphers.
Further reading
For more on how computational methods are shaping the field, visit our Mathematics section.
More information
Access the technical details of the study in the full cryptanalytic research paper.
