Cryptology ePrint Archive: Report 2017/391

Another Look at Success Probability in Linear Cryptanalysis

Subhabrata Samajder and Palash Sarkar

Abstract: This work studies the success probability of key recovery attacks based on using a single linear approximation. Previous works had analysed success probability under different hypotheses on the distributions of correlations for the right and wrong key choices. This work puts forward a unifying framework of general key randomisation hypotheses. All previously used key randomisation hypotheses as also zero correlation attacks can be seen to special cases of the general framework. Derivations of expressions for the success probability are carried out under both the settings of the plaintexts being sampled with and without replacements. Compared to previous analysis, we uncover several new cases which have not been considered in the literature. For most of the cases which have been considered earlier, we provide complete expressions for the respective success probabilities. Finally, the complete picture of the dependence of the success probability on the data complexity is revealed. Compared to the extant literature, our work provides a deeper and more thorough understanding of the success probability of single linear cryptanalysis.

Category / Keywords: secret-key cryptography / linear cryptanalysis, success probability, data complexity.

Date: received 5 May 2017, last revised 8 Dec 2017

Contact author: subhabrata samajder at gmail com, palash@isical ac in

Available format(s): PDF | BibTeX Citation

Note: Corrected a typo in the abstract.

Version: 20171209:055040 (All versions of this report)

Short URL: ia.cr/2017/391

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]