Publication

The Complexity of Distinguishing Distributions

Serge Vaudenay, Thomas Baignères
2008
Conference Papers

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.

Official source

https://infoscience.epfl.ch/entities/publication/a40400c7-3613-4b38-ac05-7aa9ae540e12

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

The Complexity of Distinguishing Distributions

Chat with Graph Search

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

Identification of typical district configurations: A two-step global sensitivity analysis framework

Graph generative deep learning models with an application to circuit topologies