DOI QR코드

DOI QR Code

Analysis of Pseudorandom Sequences Generated by Maximum Length Complemented Cellular Automata

최대길이 여원 CA 기반의 의사랜덤수열 분석

  • 최언숙 (동명대학교 정보통신공학과) ;
  • 조성진 (부경대학교 응용수학과)
  • Received : 2019.08.08
  • Accepted : 2019.10.15
  • Published : 2019.10.31

Abstract

A high-quality pseudorandom sequence generation is an important part of many cryptographic applications, including encryption protocols. Therefore, a pseudorandom number generator (PRNG) is an essential element for generating key sequences in a cryptosystem. A PRNG must effectively generate a large, high-quality random data stream. It is well known that the bitstreams output by the CA-based PRNG are more random than the bitstreams output by the LFSR-based PRNG. In this paper, we prove that the complemented CA derived from 90/150 maximum length cellular automata(MLCA) is a MLCA to design a PRNG that can generate more secure bitstreams and extend the key space in a secret key cryptosystem. Also we give a method for calculating the cell positions outputting a nonlinear sequence with maximum period in complemented MLCA derived from a 90/150 MLCA and a complement vector.

고품질 의사랜덤수열 생성은 암호화 프로토콜을 포함한 많은 암호화 응용 프로그램에서 매우 중요한 부분이다. 그러므로 의사랜덤수열 생성기(Pseudo Random Number Generator, 이하 PRNG)는 암호시스템에서 키수열 생성하는데 꼭 필요한 요소이다. PRNG는 고품질의 랜덤한 큰 데이터 스트림을 효과적으로 생성해야 한다. CA 기반의 PRNG는 LFSR기반의 PRNG에 의해 출력되는 난수열보다 랜덤성이 우수하다는 사실은 이미 잘 알려져 있다. 본 논문에서는 비밀키 암호시스템에서 보다 안전한 비트스트림을 생성하고 키 공간을 확장할 수 있는 PRNG를 설계하기 위해 최대길이를 갖는 90/150 셀룰라 오토마타(Cellular Automata, CA)로부터 유도된 여원 CA가 최대길이 CA임을 보인다. 또한 90/150 최대길이 CA(MLCA)와 여원벡터로부터 유도된 여원 MLCA의 각 셀에서 출력되는 수열 중 비선형 수열을 출력하는 셀의 위치를 분석한다.

Keywords

References

  1. J. Kim and J. Chon, "Decoding problem of random linear codes and its cryptographic application," J. of the Korean Institute of Communication Sciences, vol. 32, no. 6, 2015, pp. 30-38.
  2. E. Jang, "Synchronization and Secure Communication Application of Chaos Based Malasoma System," J. of the Korea Institute of Electronic Communication Sciences, vol. 12, no. 5, 2017, pp. 747-754. https://doi.org/10.13067/JKIECS.2017.12.5.747
  3. J. Saidov, B. Kim, J. Lee, and G. Lee, "Distributed Hardware Security System with Secure Key Update," J. of the Korea Institute of Electronic Communication Sciences, vol. 12, no. 4, 2017, pp. 671-678. https://doi.org/10.13067/JKIECS.2017.12.4.671
  4. N. Jang, C. Kim, S. Hong, and Y. Park, "Efficient Bit-Parallel Shifted Polynomial Basis Multipliers for All Irreducible Trinomial," J. of the Korea Institute of Information Security & Cryptology, vol. 19, no. 2, 2009, pp.49-61.
  5. P. Hortensius, R. McLeod, and H. Card, "Parallel random number generation for VLSI systems using cellular automata," IEEE Trans. on Computers, vol. 38, no. 10, 1989, pp. 1466-1473. https://doi.org/10.1109/12.35843
  6. S. Wolfram, "Cryptography with Cellular Automata," in Advances in Cryintology: Crypto '85 Proceedings, Lcture Notes in Computer Science 218. Santa Babara: Springer, 1986, pp. 429-432.
  7. S. Nandi, B. Kar, and P. Chaudhuri, "Theory and Applications of Cellular Automata in Cryptography," IEEE Trans. on Computers, vol. 43, no. 12, 1994, pp. 1346-1357. https://doi.org/10.1109/12.338094
  8. S. Das and D. Chowdhury, "On usage of cellular automata in strengthening stream ciphers," J. Discrete Mathematical Sciences and Cryptography, vol. 14, no. 4, 2011, pp. 369-390. https://doi.org/10.1080/09720529.2011.10698343
  9. M. Tomassini and M. Perrenoud, "Stream Ciphers with One- and Two-Dimensional Cellular Automata," Parallel Problem Solving from Nature -PPSN VI, Lecture Notes in Computer Science 1917. Paris: Springer, 2000, pp. 722-731.
  10. H. Jeong, K. Park, S. Cho, and S. Kim, "Color medical image encryption using two-dimensional chaotic map and C-MLCA," Proc. of the Int. Conf. on Ubiquitous and Future Networks, Prague, Czech Republic, 2018.
  11. U. Choi, S. Cho, J. Kim, S. Kang, H. Kim, and S. Kim, "Color image encryption based on PC-MLCA and 3-D chaotic cat map," Proc. of the 2019 IEEE 4th Int. Conf. on Computer and Communication System, Singapore, 2019, pp. 272-277.
  12. P. P. Chaudhuri, D. R. Chowdhury, S. Nandi, and S. Chattopadhyay, Additive Cellular Automata Theory and Applications, vol. 1. Los Alamitos, IEEE Computer Society Press, 1997.
  13. K. Cattell and J. C. Muzio, "Analysis of onedimensional linear hybrid cellular automata over GF(q)," IEEE Trans. Comput-Aided Design Integrated Circuits and Systems, vol. 45, no. 7, 1996, pp. 782-792.
  14. S. Cho, U. Choi, H. Kim, Y. Hwang, J. Kim, and S. Heo, "New synthesis of one-dimensional 90/150 linear hybrid group cellular automata," IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 26, no. 9, 2007, pp. 1720-1724. https://doi.org/10.1109/TCAD.2007.895784
  15. R. McEliece, Finite Fields for Computer Scientists and Engineers. Massachustts: Springer, 1987.
  16. U. Choi, S. Cho, Y. Hwang, and H. Kim, "Attack using Phase Shifts of Shrunken Sequence," J. of the Korea Institute of Electronic Communication Sciences, vol. 6, no. 1, 2011, pp. 97-104. https://doi.org/10.13067/JKIECS.2011.6.1.097