Optimal key ranking procedures in a statistical cryptanalysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2887, Issue , 2003, Pages 235-246

  Junod, Pascal ^a   Vaudenay, Serge ^a  

^a EPFL   (Switzerland)

Author keywords

Key ranking; Linear cryptanalysis; Neyman Pearson lemma; Statistical cryptanalysis

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

HYPOTHESIS TESTS; KEY RANKING; LINEAR CRYPTANALYSIS; NEYMAN-PEARSON; RANKING PROCEDURES; STATISTICAL CRYPTANALYSIS; STATISTICAL FRAMEWORK; WEIGHTED EUCLIDEAN;

CRYPTOGRAPHY;

EID: 0242487612     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39887-5_18     Document Type: Article

References (15)

1. D. Coppersmith, S. Halevi, and C. Jutla. Cryptanalysis of stream ciphers with linear masking. In Advances in Cryptology - CRYPTO'02, volume 2442 of LNCS, pages 515-532. Springer-Verlag, 2002.
2. National Bureau of Standards. Data Encryption Standard. U. S. Department of Commerce, 1977.
3. S. R. Fluhrer and D. A. McGrew. Statistical analysis of the alleged RC4 keystream generator. In FSE'00, volume 1978 of LNCS, pages 19-30. Springer-Verlag, 2001.
4. J.D. Golić and R. Menicocci. Edit probability correlation attacks on stop/go clocked keystream generators. To appear in the Journal of Cryptology.
5. C. Harpes, G. Kramer, and J.L. Massey. A generalization of linear cryptanalysis and the applicability of Matsui's piling-up lemma. In Advances in Cryptology - EUROCRYPT'95, volume 921 of LNCS, pages 24-38. Springer-Verlag, 1995.
6. P. Junod. On the complexity of Matsui's attack. In Selected Areas in Cryptography, SAC'01, volume 2259 of LNCS, pages 199-211. Springer-Verlag, 2001.
7. P. Junod. On the optimality of linear, differential and sequential distinguishers. To appear in Advances in Cryptology - EUROCRYPT'03, LNCS. Springer-Verlag, 2003.
8. L.R. Knudsen and J.E. Mathiassen. A chosen-plaintext linear attack on DES. In FSE'00, volume 1978 of LNCS, pages 262-272. Springer-Verlag, 2001.
9. B. S. Kaliski and M. J. B. Robshaw. Linear cryptanalysis using multiple approximations. In Advances in Cryptology - CRYPTO'94, volume 839 of LNCS, pages 26-39. Springer-Verlag, 1994.
10. M. Matsui. Linear cryptanalysis method for DES cipher. In Advances in Cryptology - EUROCRYPT'93, volume 765 of LNCS, pages 386-397. Springer-Verlag, 1993.
11. M. Matsui. The first experimental cryptanalysis of the Data Encryption Standard. In Advances in Cryptology - CRYPTO'94, volume 839 of LNCS, pages 1-11. Springer-Verlag, 1994.
12. I. Mironov. (Not so) random shuffles of RC4. In Advances in Cryptology - CRYPTO'02, volume 2442 of LNCS, pages 304-319. Springer-Verlag, 2002.
13. S. Murphy, F. Piper, M. Walker, and P. Wild. Likelihood estimation for block cipher keys. Technical report, Information Security Group, University of London, England, 1995.
14. T. Shimoyama and T. Kaneko. Quadratic relation of s-box and its application to the linear attack of full round DES. In Advances in Cryptology - CRYPTO'98, volume 1462 of LNCS, pages 200-211. Springer-Verlag, 1998.
15. S. Vaudenay. An experiment on DES statistical cryptanalysis. In 3rd ACM Conference on Computer and Communications Security, pages 139-147. ACM Press, 1996.