|
This article is cited in 2 scientific papers (total in 2 papers)
Spectral criterion for testing hypotheses on random permutations
O. V. Denisov Sertification Research Center, LLC, Moscow
Abstract:
Suppose that for each of $N$ independent identically distributed random permutations we observe a pair consisting of a random uniformly distributed argument and a corresponding value of permutation. We consider the problem of testing the hypothesis that the distribution of permutations is uniform against the hypothesis that permutations are the products of r independent permutations with known distribution. A test constructed by eigenvectors of matrices of transition probabilities (arguments to values) is proposed and investigated.
Key words:
random permutations, block ciphers, distinguishing attack, matrix of the transition probabilities, eigenvectors.
Received 15.IX.2015
Citation:
O. V. Denisov, “Spectral criterion for testing hypotheses on random permutations”, Mat. Vopr. Kriptogr., 7:3 (2016), 19–28
Linking options:
https://www.mathnet.ru/eng/mvk193https://doi.org/10.4213/mvk193 https://www.mathnet.ru/eng/mvk/v7/i3/p19
|
Statistics & downloads: |
Abstract page: | 319 | Full-text PDF : | 224 | References: | 36 | First page: | 6 |
|