Welcome to the resource topic for
**2024/722**

**Title:**

Ultrametric integral cryptanalysis

**Authors:**
Tim Beyne, Michiel Verbauwhede

**Abstract:**

A systematic method to analyze \emph{divisibility properties} is proposed.

In integral cryptanalysis, divisibility properties interpolate between bits that sum to zero (divisibility by two) and saturated bits (divisibility by 2^{n - 1} for 2^n inputs).

From a theoretical point of view, we construct a new cryptanalytic technique that is a non-Archimedean multiplicative analogue of linear cryptanalysis. It lifts integral cryptanalysis to characteristic zero in the sense that, if all quantities are reduced modulo two, then one recovers the algebraic theory of integral cryptanalysis.

The new technique leads to a theory of trails. We develop a tool based on off-the-shelf solvers that automates the analysis of these trails and use it to show that many integral distinguishers on PRESENT and SIMON are stronger than expected.

**ePrint:**
https://eprint.iacr.org/2024/722

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

**Example resources include:**
implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .