A generalization of linear cryptanalysis and the applicability of Matsui's piling-up lemma

  • Authors:
  • Carlo Harpes;Gerhard G. Kramer;James L. Massey

  • Affiliations:
  • Swiss Federal Institute of Technology, Signal and Info. Proc. Lab., Zürich;Swiss Federal Institute of Technology, Signal and Info. Proc. Lab., Zürich;Swiss Federal Institute of Technology, Signal and Info. Proc. Lab., Zürich

  • Venue:
  • EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

Matsui's linear cryptanalysis for iterated block ciphers is generalized by replacing his linear expressions with I/O sums. For a single round, an I/O sum is the XOR of a balanced binary-valued function of the round input and a balanced binary-valued function of the round output. The basic attack is described and conditions for it to be successful are given. A procedure for finding effective I/O sums, i.e., I/O sums yielding successful attacks, is given. A cipher contrived to be secure against linear cryptanalysis but vulnerable to this generalization of linear cryptanalysis is given. Finally, it is argued that the ciphers IDEA and SAFER K-64 are secure against this generalization.