Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Optimal Key Ranking Procedures in a Statistical Cryptanalysis
 
conference paper

Optimal Key Ranking Procedures in a Statistical Cryptanalysis

Junod, Pascal  
•
Vaudenay, Serge  
2003
The 10th International Workshop on Fast Software Encryption, FSE 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.

  • Files
  • Details
  • Metrics
Type
conference paper
DOI
10.1007/978-3-540-39887-5_18
Web of Science ID

WOS:000188181900018

Author(s)
Junod, Pascal  
Vaudenay, Serge  
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

Subjects

Key ranking

•

statistical cryptanalysis

•

Neyman-Pearson lemma

•

linear cryptanalysis

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
LASEC  
Event nameEvent placeEvent date
The 10th International Workshop on Fast Software Encryption, FSE 2003

Lund, Sweden

February 24-26, 2003

Available on Infoscience
January 19, 2007
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/239797
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés