Baignères, ThomasVaudenay, Serge2008-09-022008-09-022008-09-02200810.1007/978-3-540-85093-9_20https://infoscience.epfl.ch/handle/20.500.14299/27687WOS:000258319800020Cryptography 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.text::conference output::conference proceedings::conference paper