On the optimality of linear, differential, and sequential distinguishers

38Citations
Citations of this article
47Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we consider the statistical decision processes behind a linear and a differential cryptanalysis. By applying techniques and concepts of statistical hypothesis testing, we describe precisely the shape of optimal linear and differential distinguishers and we improve known results of Vaudenay concerning their asymptotic behaviour. Furthermore, we formalize the concept of "sequential distinguisher" and we illustrate potential applications of such tools in various statistical attacks. © International Association for Cryptologic Research 2003.

Cite

CITATION STYLE

APA

Junod, P. (2003). On the optimality of linear, differential, and sequential distinguishers. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2656, 17–32. https://doi.org/10.1007/3-540-39200-9_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free