Cryptology ePrint Archive: Report 2016/990

Revisiting the Wrong-Key-Randomization Hypothesis

Tomer Ashur and Tim Beyne and Vincent Rijmen

Abstract: Linear cryptanalysis is considered to be one of the strongest techniques in the cryptanalyst’s arsenal. In most cases, Matsui’s Algorithm 2 is used for the key recovery part of the attack. The success rate analysis of this algorithm is based on an assumption regarding the bias of a linear approximation for a wrong key, known as the wrong-key-randomization hypothesis. This hypothesis was refined by Bogdanov and Tischhauser to take into account the stochastic nature of the bias for a wrong key. We provide further refinements to the analysis of Matsui’s Algorithm 2 by considering sampling without replacement. This paper derives the distribution of the observed bias for wrong keys when sampling is done without replacement and shows that less data are required in this scenario. It also develops formulas for the success probability and the required data complexity when this approach is taken. The formulas predict that the success probability may reach a peak and then decrease as more pairs are considered. We provide a new explanation for this behavior and derive the conditions for encountering it. We empirically verify our results and compare them to previous work.

Category / Keywords: secret-key cryptography / linear cryptanalysis, wrong-key-randomization hypothesis, success probability, data complexity

Original Publication (in the same form): IACR-JOC-2020

Date: received 13 Oct 2016, last revised 12 Feb 2020

Contact author: tim beyne at esat kuleuven be

Available format(s): PDF | BibTeX Citation

Version: 20200212:112344 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]