论文信息 - On a Cipher Based on Pseudo-random Walks on Graphs

On a Cipher Based on Pseudo-random Walks on Graphs

In the paper a cipher which uses transition graph in the encryption and decryption processes is presented. It is created based on some ideas of dynamic systems (symbolic dynamics). The introduced cipher is tested according to the suggestions of FIPS 140-2 standard and the results are presented in the paper.

[1] Kazuyuki Aihara,et al. Cryptosystems based on space-discretization of chaotic maps , 2001, ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196).

[2] Lawrence E. Bassham,et al. Randomness Testing of the Advanced Encryption Standard Finalist Candidates , 2000 .

[3] Elaine B. Barker,et al. A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications , 2000 .

[4] Ren-ji Tao,et al. On Finite Automaton Public-Key Cryptosystem , 1999, Theor. Comput. Sci..

[5] Ying-Cheng Lai,et al. Controlling chaos , 1994 .

[6] Wit Forys,et al. Pseudo-Random Walks On Graphs And Cryptography , 2009, FCS.

[7] Douglas Lind,et al. An Introduction to Symbolic Dynamics and Coding , 1995 .

[8] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .

[9] Juan Soto. Randomness Testing of the Advanced Encryption Standard Candidate Algorithms , 1999 .

[10] Zbigniew Kotulski,et al. Discrete chaotic cryptography , 1997 .

[11] Tomasz Kapitaniak,et al. Controlling Chaos: Theoretical and Practical Methods in Non-linear Dynamics , 1996 .