Security in Communication Networks

Volume 2576 of the series Lecture Notes in Computer Science pp 174-185


On Probability of Success in Linear and Differential Cryptanalysis

  • Ali Aydin SelçukAffiliated withDepartment of Computer Sciences, Purdue Univeristy
  • , Ali BiçakAffiliated withMaryland Center for Telecommunications ResearchDepartment of Computer Science and Electrical Engineering, University of Maryland Baltimore County

* Final gross prices may vary according to local VAT.

Get Access


Despite their widespread usage in block cipher analysis, the success probability estimation of differential and linear cryptanalytic attacks has traditionally been carried out in a rather ad hoc fashion. In this paper, we present an analytical calculation of the success probability of these attacks. Besides providing a sound formulation of the success probabilities, the analysis reveals some previously unnoticed factors affecting the success of an attack, such as the attacked key length in differential cryptanalysis. The results apply to an extended sense of the term “success” where the correct key is found not necessarily as the highest-ranking candidate but within a set of highest-ranking candidates.