Sciweavers

Share
FSE
2003
Springer

Optimal Key Ranking Procedures in a Statistical Cryptanalysis

9 years 1 months ago
Optimal Key Ranking Procedures in a Statistical Cryptanalysis
Hypothesis tests have been used in the past as a tool in a cryptanalytic context. In this paper, we propose to use this paradigm and define a precise and sound statistical framework in order to optimally mix information on independent attacked subkey bits obtained from any kind of statistical cryptanalysis. In the context of linear cryptanalysis, we prove that the best mixing paradigm consists of sorting key candidates by decreasing weighted Euclidean norm of the bias vector.
Pascal Junod, Serge Vaudenay
Added 06 Jul 2010
Updated 06 Jul 2010
Type Conference
Year 2003
Where FSE
Authors Pascal Junod, Serge Vaudenay
Comments (0)
books