The Complexity of Distinguishing Distributions (Invited Talk)

  • Authors:
  • Thomas Baignères;Serge Vaudenay

  • Affiliations:
  • EPFL, Lausanne, Switzerland CH-1015;EPFL, Lausanne, Switzerland CH-1015

  • Venue:
  • ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Cryptography often meets the problem of distinguishing distributions. In this paper we review techniques from hypothesis testing to express the advantage of the best distinguisher limited to a given number of samples. We link it with the Chernoff information and provide a useful approximation based on the squared Euclidean distance. We use it to extend linear cryptanalysis to groups with order larger than 2.