Paper 2018/478

On Non-Monotonicity of the Success Probability in Linear Cryptanalysis

Ali Aydin Selcuk

Abstract

Like any other cryptanalytic attack, the success rate of a linear attack is expected to improve as more data becomes available. Bogdanov and Tischhauser (FSE 2013) made the rather surprising claim that the success rate of a linear attack may go down with increasing plaintext amount, after an optimal point. They supported this claim with experimental evidence by an attack on SmallPresent-20. Different explanations have been given to explain this surprising phenomenon. In this note, we give quantitative values regarding when this phenomenon can be observed. We conclude that it should not be an issue for attacks in practice except for those with a tiny bias.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Preprint.
Keywords
Linear cryptanalysissuccess probabilitynon-monotonicity.
Contact author(s)
aliaydinselcuk @ gmail com
History
2018-05-23: received
Short URL
https://ia.cr/2018/478
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2018/478,
      author = {Ali Aydin Selcuk},
      title = {On Non-Monotonicity of the Success Probability in Linear Cryptanalysis},
      howpublished = {Cryptology ePrint Archive, Paper 2018/478},
      year = {2018},
      note = {\url{https://eprint.iacr.org/2018/478}},
      url = {https://eprint.iacr.org/2018/478}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.