Improving linear cryptanalysis of LOKI91 by probabilistic counting method
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1024103
- scientific article; zbMATH DE number 503240
- scientific article; zbMATH DE number 1024009
- scientific article; zbMATH DE number 697799
- On linear cryptanalysis with many linear approximations
- Another look at success probability of linear cryptanalysis
- Improving the Time Complexity of Matsui’s Linear Cryptanalysis
- scientific article; zbMATH DE number 4191565
- On Large Distributions for Linear Cryptanalysis
Cites work
- Advances in cryptology - AUSCRYPT '90. International conference on cryptology, Sydney, Australia, January 8-10, 1990. Proceedings
- Counting large numbers of events in small registers
- scientific article; zbMATH DE number 417582 (Why is no real title available?)
- scientific article; zbMATH DE number 697799 (Why is no real title available?)
- scientific article; zbMATH DE number 1024103 (Why is no real title available?)
- scientific article; zbMATH DE number 1030989 (Why is no real title available?)
- scientific article; zbMATH DE number 1394292 (Why is no real title available?)
- scientific article; zbMATH DE number 1406761 (Why is no real title available?)
- scientific article; zbMATH DE number 1406762 (Why is no real title available?)
- Non-linear approximations in linear cryptanalysis
- Provable security against a differential attack
Cited in
(4)
This page was built for publication: Improving linear cryptanalysis of LOKI91 by probabilistic counting method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4639334)
