CryptoDB
Key Mixing in Block Ciphers through Addition modulo $2^n$
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2005-12717, title={Key Mixing in Block Ciphers through Addition modulo $2^n$}, booktitle={IACR Eprint archive}, keywords={secret-key cryptography / Block Ciphers, linear cryptanalysis, Key Mixing, Linear Approximations, Piling-Up Lemma}, url={http://eprint.iacr.org/2005/383}, note={ debdeep@vlsi.iitkgp.ernet.in 13078 received 22 Oct 2005}, author={Debdeep Mukhopadhyay and Dipanwita RoyChowdhury}, year=2005 }