## Cryptology ePrint Archive: Report 2005/383

Key Mixing in Block Ciphers through Addition modulo $2^n$

Abstract: The classical technique to perform key mixing in block ciphers is through exclusive-or (exor). In this paper we show that when the $n$-bit key is mixed in a block cipher of size $n$ bits via addition modulo $2^n$, the bias of the linear approximations falls exponentially fast. Experimental results have been provided to show that such a scheme cannot be cryptanalyzed using Linear Cryptanalysis.

Category / Keywords: secret-key cryptography / Block Ciphers, linear cryptanalysis, Key Mixing, Linear Approximations, Piling-Up Lemma

Contact author: debdeep at vlsi iitkgp ernet in

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Short URL: ia.cr/2005/383

[ Cryptology ePrint archive ]