Metraipolis › archive › dc_fe46a2225e2c

Masked Differential-linear Distinguishers and Quantum Approaches — arXiv:2608.24799

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.24799
License (as archived)
CC0-1.0
Archived
2026-10-18T06:30:47.390Z
SHA-256 of the archived text
a3ae02d893bf0c47255bba5980294a8572cf20ca676d6a38aecd1b8e65aa2956
Stable URL of this page
https://metraipolis.com/documento/dc_fe46a2225e2c

How to cite

Masked Differential-linear Distinguishers and Quantum Approaches — arXiv:2608.24799 — arXiv (en), https://arxiv.org/abs/2608.24799 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fe46a2225e2c (Metraipolis archive dc_fe46a2225e2c, sha256 a3ae02d893bf0c47255bba5980294a8572cf20ca676d6a38aecd1b8e65aa2956)
BibTeX
@misc{dcfe46a2225e2c,
  title = {Masked Differential-linear Distinguishers and Quantum Approaches — arXiv:2608.24799},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.24799},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fe46a2225e2c; sha256 a3ae02d893bf0c47255bba5980294a8572cf20ca676d6a38aecd1b8e65aa2956},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.24799. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We introduce masked auto-correlation, a new primitive for the cryptanalysis of symmetric-key primitives, together with a quantum attack pipeline built on it. For a permutation $f$, output masks $\alpha,\beta$, and an input difference $w$, masked auto-correlation (MAC) measures the correlation between the masked outputs $\alpha\cdot f(x)$ and $\beta\cdot f(x\oplus w)$. The associated masked differential-linear (MDL) approximations strictly generalize several classical techniques; ordinary linear cryptanalysis, differential-linear cryptanalysis, and the differential-linear connectivity table all arise as special cases. Our central object of study is the problem of finding mask pairs with large masked cross-correlation -- those that yield powerful distinguishers -- which we call MAC Fishing. We give a constant-query quantum algorithm that samples such pairs according to their squared correlation, and we prove an exponential classical lower bound of $\Omega(N/\log N)$ queries, by adapting the hardness of Fourier Fishing. To our knowledge this is the first result pairing a quantum upper bound with a classical lower bound for the core task of identifying high-correlation approximations, making quantum algorithms an absolute necessity. Building on this, we analyse the distribution of masked auto-correlation for random permutations, and then construct capacity-based distinguishers and key-recovery attacks, both classically and with a quadratic quantum speed-up using amplitude estimation. We validate our claims with experiments on reduced-round mini-AES.

Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-08-26 in cs.CR).
Categorie arXiv: Quantum Physics (quant-ph) ; Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2608.24799 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T06:27:46.699Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-08-26?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).