### A More Explicit Formula for Linear Probabilities of Modular Addition Modulo a Power of Two

S. M. Dehnavi, A. Mahmoodi Rishakani, and M. R. Mirzaee Shamsabad

##### Abstract

Linear approximations of modular addition modulo a power of two was studied by Wallen in 2003. He presented an efficient algorithm for computing linear probabilities of modular addition. In 2013 Sculte-Geers investigated the problem from another viewpoint and derived a somewhat explicit for these probabilities. In this note we give a closed formula for linear probabilities of modular addition modulo a power of two, based on what Schlte-Geers presented: our closed formula gives a better insight on these probabilities and more information can be extracted from it.

Available format(s)
Category
Secret-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
Modular addition modulo a power of twoLinear probabilitySymmetric cipherLinear Cryptanalysis
Contact author(s)
std_dehnavism @ khu ac ir
History
2015-02-25: last of 3 revisions
See all versions
Short URL
https://ia.cr/2015/026

CC BY

BibTeX

@misc{cryptoeprint:2015/026,
author = {S.  M.  Dehnavi and A.  Mahmoodi Rishakani and M.  R.  Mirzaee Shamsabad},
title = {A More Explicit Formula for Linear Probabilities of Modular Addition Modulo a Power of Two},
howpublished = {Cryptology ePrint Archive, Paper 2015/026},
year = {2015},
note = {\url{https://eprint.iacr.org/2015/026}},
url = {https://eprint.iacr.org/2015/026}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.