The Study of Modulo $2^n$

Zhongfeng Niu

Paper 2021/056

The Study of Modulo $2^n$

Zhongfeng Niu

Abstract

In this paper, we present a new concept named the basic function. By the study of the basic function, we find the $O(n)$-time algorithm to calculate the probability or correlation for some property of Modulo $2^n$, including the difference-linear connective correlation coefficients, the linear approximation correlation coefficients, the differential probability, difference-boomerange connective probability, boomerange connective probability, boomerange-difference connective probability, etc.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Preprint. MINOR revision.
Keywords: modulo
Contact author(s): niuzhongfeng1996 @ 163 com
History: 2021-05-31: last of 10 revisions; 2021-01-18: received; See all versions
Short URL: https://ia.cr/2021/056
License: CC BY

BibTeX

@misc{cryptoeprint:2021/056,
      author = {Zhongfeng Niu},
      title = {The Study of Modulo $2^n$},
      howpublished = {Cryptology ePrint Archive, Paper 2021/056},
      year = {2021},
      note = {\url{https://eprint.iacr.org/2021/056}},
      url = {https://eprint.iacr.org/2021/056}
}