conference paper
Optimal Key Ranking Procedures in a Statistical Cryptanalysis
2003
The 10th International Workshop on Fast Software Encryption, FSE 2003
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.
Type
conference paper
Web of Science ID
WOS:000188181900018
Author(s)
Date Issued
2003
Published in
The 10th International Workshop on Fast Software Encryption, FSE 2003
Series title/Series vol.
Lecture Notes in Computer Science; 2887
Start page
235
End page
246
Editorial or Peer reviewed
REVIEWED
Written at
EPFL
EPFL units
Event name | Event place | Event date |
Lund, Sweden | February 24-26, 2003 | |
Available on Infoscience
January 19, 2007
Use this identifier to reference this record