[Resource Topic] 2005/383: Key Mixing in Block Ciphers through Addition modulo $2^n$

Welcome to the resource topic for 2005/383

Title:
Key Mixing in Block Ciphers through Addition modulo 2^n

Authors: Debdeep Mukhopadhyay, Dipanwita RoyChowdhury

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.

ePrint: https://eprint.iacr.org/2005/383

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .