The Journal of the Korea institute of electronic communication sciences (한국전자통신학회논문지)

Korea Institute of Electronic Communication Science (한국전자통신학회)
권호 표지
DOI QR코드

DOI QR Code

Synthesis Of Asymmetric One-Dimensional 5-Neighbor Linear MLCA

비대칭 1차원 5-이웃 선형 MLCA의 합성

  • Choi, Un-Sook (School of Artificial Intelligence, Tongmyong University)
  • Received : 2022.01.13
  • Accepted : 2022.04.17
  • Published : 2022.04.30
Download PDF
⟨ Previous Next ⟩

Abstract

Cellular Automata (CA) is a discrete and abstract computational model that is being applied in various fields. Applicable as an excellent pseudo-random sequence generator, CA has recently developed into a basic element of cryptographic systems. Several studies on CA-based stream ciphers have been conducted and it has been observed that the encryption strength increases when the radius of a CA's neighbor is increased when appropriate CA rules are used. In this paper, among CAs that can be applied as a one-dimensional pseudo-random number sequence generator (PRNG), one-dimensional 5-neighbor CAs are classified according to the connection state of their neighbors, and the ignition relationship of the characteristic polynomial is obtained. Also this paper propose a synthesis algorithm for an asymmetric 1-D linear 5-neighbor MLCA in which the radius of the neighbor is increased by 2 using the one-dimensional 3-neighbor 90/150 CA state transition matrix.

셀룰라 오토마타(이하 CA)는 이산적이고 추상적인 계산 모델로 다양한 분야에서 적용되고 있다. 우수한 의사 난수열 생성기로 적용 가능한 CA는 최근에 암호 시스템의 기본 요소로 발전했다. CA 기반 스트림 암호에 대한 여러 연구가 수행되었으며 적절한 CA 규칙이 사용되는 경우 CA의 이웃의 반경이 증가될 때, 암호화 강도가 증가됨이 관찰되었다. 본 논문에서는 1차원 의사 난수열 생성기(PRNG)로 응용될 수 있는 CA 중 1차원 5-이웃 CA를 이웃의 연결 상태에 따라 분류하고, 특성다항식의 점화관계를 구한다. 또한 1차원 3-이웃 90/150 CA의 상태 전이행렬을 이용하여 이웃의 반경을 2로 증가시킨 비대칭 5-이웃 선형 MLCA를 합성 알고리즘을 제안한다.

Keywords

Acknowledgement

본 논문은 2021년 한국전자통신학회 추계 학술대회 우수논문으로 선정된 "1차원 5-이웃 선형 셀룰라 오토마타의 특성"을 수정 및 확장한 것이며 이 연구는 Tongmyeong University Research Grants 2021(2021A025)의 지원에 의한 것임.

References

  1. S. Wolfram, "Theory and Applications of Cellular Automata," IEEE Transactions on Computers, vol. 43, no. 12, Jan. 1995, pp. 1346-1357
  2. M. Matsumoto, "Simple cellular automata as pseudorandom m-sequence generators for built-in self-test," ACM Trans. Model. Comput. Simul. vol. 8, no. 1, 1998, pp. 31-42. https://doi.org/10.1145/272991.273007
  3. H. Jeong, S. Cho, and S. Kim, "Medical image encryption based on C-MLCA and 1D CAT," J. of the Korea Institute of Electronic Communication Sciences, vol. 14, no. 2, Apr. 2019, pp. 439-446. https://doi.org/10.13067/JKIECS.2019.14.2.439
  4. M. Tomassini, M. Sipper, and M. Perrenoud, "On the generation of high-quality random numbers by two-dimensional cellular automata," IEEE Trans. Comput. vol. 49, no. 10, Oct. 2000, pp. 1146-1151. https://doi.org/10.1109/12.888056
  5. S. Roy, J. Karjee, U. Rawat, D. Pratik, and N. Dey, "Symmetric key encryption technique: A cellular automata based approach in wireless sensor networks," Comput. Sci., vol. 78, 2016, pp. 408-414.
  6. K. Cattell and J. Muzio, "Synthesis of one-dimensional linear hybrid cellular automata," IEEE Trans. Comput-Aided Design Integr. Circuits Syst., vol. 19, no. 3, Mar. 1996, pp. 325-335.
  7. 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, Sept. 2007, pp. 1720-1724. https://doi.org/10.1109/TCAD.2007.895784
  8. U. Choi, S. Cho, H. Kim, and J. Kim, "90/150 CA corresponding to polynomial of maximum weight," J. of Cellular Automata, vol. 13, no. 4, 2018, pp. 347-358.
  9. U. Choi, S. Cho, H. Kim, and M. Kwon, "Analysis of 90/150 CA corresponding to the power of irreducible polynomials," J. of Cellular Automata, vol. 14, no. 5-6, 2019, pp. 417-433.
  10. H. Kim, S. Cho, U. Choi, M. Kwon, and G. Kong, "Synthesis of uniform CA and 90/150 hybrid CA," J. of the Korea Institute of Electronic Communication Sciences, vol. 11, no. 3, Mar. 2016, pp. 293-302. https://doi.org/10.13067/JKIECS.2016.11.3.293
  11. S. Maiti and D. Chowdhury, "Study of five-neighborhood linear hybrid cellular automata and their synthesis," 2017 the 3rd Int. Conf. on Mathematics and Computing, Haldia, India, Jan. 2017, pp. 68-83.
  12. S. Cho, H. Kim, U. Choi, and S. Kang, "Synthesis of Symmetric 1-D 5-neighborhood CA using Krylov Matrix," J. of the Korea Institute of Electronic Communication Sciences, vol. 15, no. 6, Dec. 2020, pp.1105-1111. https://doi.org/10.13067/JKIECS.2020.15.6.1105
  13. U. Choi, H. Kim, S. Kang, and S. Cho, "Design of Key Sequence Generators Based on Symmetric 1-D 5-Neighborhood CA," J. of the Korea Institute of Electronic Communication Sciences, vol. 16, no. 3, June 2021, pp. 533-540. https://doi.org/10.13067/JKIECS.2021.16.3.533
  14. P. Chaudhuri, D. Chowdhury, S. Nandi and S. Chattopadhyay, Additive cellular automata, Theory and applications, vol. 1. Los Alamitos: IEEE Computer Society Press, 1997.
  15. U. Choi, S. Cho and S. Kang, "1-D symmetric 5-neighbor MLCA based color image encryption," 2021 IEEE the 6th Int. Conf. on Computer and Communication Systems, Chengdu, China, Apr. 2021, pp. 1-6.
  16. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge, Cambridge Univ. Press, 1985.