DEVELOPMENT AND INVESTIGATION OF THE KEY STREAM GENERATORS ON THE BASE OF CELLULAR AUTOMATA
DOI:
https://doi.org/10.15588/1607-3274-2015-3-7Keywords:
stream cipher, binary key stream generators, cellular automaton, statistical characteristics, secure communications system.Abstract
This paper presents the development and investigations of the binary key stream generators statistical characteristics. Developed generators based on the elementary rules of cells interaction: simple, modified and combined classical rules. We believe that elementary rules «30», «86», «135», «149» are most promising from statistical point of view. Modifications were consist of combining of array bits before outputting and combining various elementary rules of automaton cells interaction. It was developed a new simple interaction rule, based on the logical operation XOR. The investigation of statistical properties was performed using NIST STS v1.8. All designed generators showed good statistical characteristics, which indicates their satisfactory cryptoresistance. In addition we’ve investigated the developed generators linear complexity using Berlekamp-Massey algorithm. Obtained results shows the high values of linear complexity (about half of the cellular automaton length), which is typical for such structures type. On the base of the developed generator with own cells interaction rule has developed a system for secure communication of audio, text and file information. The statistical investigations of encrypted file showed that it satisfies all the NIST STS requirements.References
Wolfram S. Random sequence generation by cellular automata / S. Wolfram // Advances in Applied Mathematics. – 1986. – Vol. 7. – P. 123–164. DOI: http://dx.doi.org/10.1016/0196- 8858(86)90028-X 2. Kar B. K. Theory and applications of cellular automata in cryptography / B. K. Kar, S. Nandi, P. P. Chaundhuri // IEEE Transactions on Computers. – 1994. – Vol. 43(12). – P. 1346– 1357. DOI: http://dx.doi.org/10.1109/12.338094 3. Mazoyer J. Signals in one-dimensional cellular automata / J. Mazoyer, V. Terrier // Theoretical Computer Science. – 1999. – Vol. 217(1). – P. 53–80. DOI: http://dx.doi.org/10.1016/S0304- 3975(98)00150-9 4. Mihaljevic M. A cellular automaton based fast one-way hash function suitable for hardware implementation / M. Mihaljevic, Y. Zheng, H. Imai // Public Key Cryptography : Lecture Notes in Computer Science. – Springer Verlag. – 1988. – P. 217–234. DOI: http://dx.doi.org/10.1007/BFb0054027 5. Porter R. B. Evolving FPGA based cellular automata / R. B. Porter, N. W. Bergmann // In: B. McKay, X. Yao, C. S. Newton, J-H. Kim, and T. Furuhashi (eds.). – SEAL : Lecture Notes in Computer Science. – 1998, Vol. 1585. – P. 114–121. DOI: http://dx.doi.org/10.1007/3-540-48873-1_16 6. Seredynski F. Cellular automata computations and secret key cryptography / F. Seredynski, P. Bouvry, A. V. Zomaya // Parallel Computing. – 2003. – Vol. 30. – P. 753–766. DOI: http:// dx.doi.org/10.1016/j.parco.2003.12.014 7. Росошек С. К. Криптосистемы клеточных автоматов / С. К. Росошек, С. И. Боровков, О. О. Евсютин // Прикладная дискретная математика. – 2008. – Т. 1 (1). – С. 43–49. – [Электронный ресурс]. – Режим доступа: http:// cyberleninka.ru/article/n/kriptosistemy-kletochnyh-avtomatov 8. Jegadish Kumar K. J. Novel and Efficient Cellular Automata Based Symmetric Key Encryption Algorithm for Wireless Sensor Networks / K. J. Jegadish Kumar, K. Chenna Kesava Reddy, S. Salivahanan // International Journal of Computer Applications. – 2011. – Vol. 13(4). – P. 30–37. DOI: http://dx.doi.org/10.5120/ 1767-2424 9. Сухинин Б. М. Высокоскоростные генераторы псевдослучайных последовательностей на основе клеточных автоматов / Б. М. Сухинин // Прикладная дискретная математика. – 2010. – Т. 2 (8). – С. 34–41. – [Электронный ресурс]. – Режим доступа: http://cyberleninka.ru/article/n/vysokoskorostnyegeneratory- psevdosluchaynyh-posledovatelnostey-na-osnovekletochnyh-avtomatov 10. Norziana J. A New Cryptographic Hash Function Based on Cellular Automata Rules 30, 134 and Omega-Flip Network / J. Norziana, M. Ramlan, Muhammad Reza Z’aba // 2012 International Conference on Information and Computer networks (ICICN-2012). – IACSIT Press, Singapore. – 2012. – V. 27. – P. 163–169. – [Electronic resource]. – Access mode: http://www.ipcsit.com/vol27/32-ICICN2012-N10006.pdf 11. Wolfram S. A New Kind of Science / S. Wolfram // Wolfram Media, Inc. – 2002. – 1197 p. – [Electronic resource]. – Access mode: http://www.wolframscience.com/nksonline/toc.html
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2015 O. D. Val, V. V. Zhikharevich, R. I. Ovchar, S. E. Ostapov
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Creative Commons Licensing Notifications in the Copyright Notices
The journal allows the authors to hold the copyright without restrictions and to retain publishing rights without restrictions.
The journal allows readers to read, download, copy, distribute, print, search, or link to the full texts of its articles.
The journal allows to reuse and remixing of its content, in accordance with a Creative Commons license СС BY -SA.
Authors who publish with this journal agree to the following terms:
-
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License CC BY-SA that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
-
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
-
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.