Fast computation of large distributions and its cryptographic applications

  • Authors:
  • Alexander Maximov;Thomas Johansson

  • Affiliations:
  • Dept. of Information Technology, Lund University, Sweden, Lund, Sweden;Dept. of Information Technology, Lund University, Sweden, Lund, Sweden

  • Venue:
  • ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Let X1,X2,..., Xk be independent n bit random variables. If they have arbitrary distributions, we show how to compute distributions like Pr{X1⊕X2⊕...⊕Xk} and Pr$\{X_1 \boxplus X_2 \boxplus ...\boxplus X_k\}$ in complexity O(kn 2n). Furthermore, if X1,X2,..., Xk are uniformly distributed we demonstrate a large class of functions F(X1,X2,..., Xk), for which we can compute their distributions efficiently. These results have applications in linear cryptanalysis of stream ciphers as well as block ciphers. A typical example is the approximation obtained when additions modulo 2n are replaced by bitwise addition. The efficiency of such an approach is given by the bias of a distribution of the above kind. As an example, we give a new improved distinguishing attack on the stream cipher SNOW 2.0.