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

Category / Keywords: secret-key cryptography / Modular addition modulo a power of two, Linear probability, Symmetric cipher, Linear Cryptanalysis

Date: received 12 Jan 2015, last revised 25 Feb 2015

Contact author: std_dehnavism at khu ac ir

Available format(s): PDF | BibTeX Citation

Version: 20150225:182607 (All versions of this report)

Short URL: ia.cr/2015/026

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]