Paper 2024/763

Class-Average Differential Uniformity and Fixed-Instance Constraints in Modular and Rounded Feistel Components

Yu Morishima, Tohoku Gakuin University
Masahiro Kaminaga, Tohoku Gakuin University
Abstract

This paper analyzes differential probabilities in one Feistel round with binary-encoded modular-linear maps or rounded linear maps as internal components. For any fixed round key and any nonzero input difference chosen independently of the matrix instance, the output-difference distribution is uniform after averaging over the instance distribution. For a fixed instance, the 2-adic valuations of the relevant matrix entries deterministically fix certain output-difference bits. We consider an adversary that selects a low-weight input difference maximizing the number of fixed bits and derive lower bounds on the restricted maximum differential probability and its average over instances. The matrix-averaged lower bound is expressed in terms of the exponential moment of the maximum fixed-bit count and is compared with the generic lower bound induced by differential-pair symmetry.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Preprint.
Keywords
differential cryptanalysisFeistel networksmaximum differential probabilitymodular arithmetic
Contact author(s)
morishima @ mail tohoku-gakuin ac jp
History
2026-07-30: last of 3 revisions
2024-05-19: received
See all versions
Short URL
https://ia.cr/2024/763
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2024/763,
      author = {Yu Morishima and Masahiro Kaminaga},
      title = {Class-Average Differential Uniformity and Fixed-Instance Constraints in Modular and Rounded Feistel Components},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/763},
      year = {2024},
      url = {https://eprint.iacr.org/2024/763}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.