Zheng Hao. Lexicographic Order and Its Application in Testing the Randomness of DES S-boxes[J]. Journal of Beijing University of Technology, 1993, 19(1): 34-41.
Citation:
Zheng Hao. Lexicographic Order and Its Application in Testing the Randomness of DES S-boxes[J]. Journal of Beijing University of Technology, 1993, 19(1): 34-41.
Zheng Hao. Lexicographic Order and Its Application in Testing the Randomness of DES S-boxes[J]. Journal of Beijing University of Technology, 1993, 19(1): 34-41.
Citation:
Zheng Hao. Lexicographic Order and Its Application in Testing the Randomness of DES S-boxes[J]. Journal of Beijing University of Technology, 1993, 19(1): 34-41.
Lexicographic Order and Its Application in Testing the Randomness of DES S-boxes
This paper consists of two parts, the forst of which prover a theorem that can calculate the lexicographic order of a permutation. In the second part the paper applies the lexicograhic order to test the randomness fo the DES S-boxws by two means-Pearson χ2 test and Kolmogorov test.
DownLoad: