You are looking at a specific version 20150225:182607 of this paper.
See the latest version.
Paper 2015/026
A More Explicit Formula for Linear Probabilities of Modular Addition Modulo a Power of Two
S. M. Dehnavi and 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.
Metadata
- 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
- 2015-01-14: received
- See all versions
- Short URL
- https://ia.cr/2015/026
- License
-
CC BY