In one dimension, there is essentially just one binomially distributed statistic, bias or correlation, for testing correctness of a key bit in Matsui's Algorithm 1. In multiple dimensions, different statistical approaches for finding the correct key candidate are available. The purpose of this work is to investigate the efficiency of such test in theory and practice, and propose a new key class ranking statistic using distributions based on multidimensional linear approximation and generalisation of the ranking statistic presented by Selc cuk.
@InProceedings{hermelin_et_al:DagSemProc.09031.14, author = {Hermelin, Miia and Cho, Joo Yeon and Nyberg, Kaisa}, title = {{Statistical Tests for Key Recovery Using Multidimensional Extension of Matsui's Algorithm 1}}, booktitle = {Symmetric Cryptography}, pages = {1--14}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9031}, editor = {Helena Handschuh and Stefan Lucks and Bart Preneel and Phillip Rogaway}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09031.14}, URN = {urn:nbn:de:0030-drops-19541}, doi = {10.4230/DagSemProc.09031.14}, annote = {Keywords: Block cipher, key recovery attacks, key ranking, linear cryptanalysis, multidimensional approximation} }
Feedback for Dagstuhl Publishing