Cryptology ePrint Archive: Report 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.

Category / Keywords: secret-key cryptography / modulo

Date: received 14 Jan 2021, last revised 30 May 2021

Contact author: niuzhongfeng1996 at 163 com

Available format(s): PDF | BibTeX Citation

Version: 20210531:014530 (All versions of this report)

Short URL: ia.cr/2021/056