Cryptographic Algorithm Based on Hybrid One-Dimensional Cellular Automata

Author:

Stănică George Cosmin1ORCID,Anghelescu Petre1ORCID

Affiliation:

1. Department of Electronics, Computers and Electrical Engineering, University of Pitesti, 110040 Pitesti, Romania

Abstract

The theory and application of cellular automata (CA) for a stream cipher-based encryption principle are presented in this study. Certain fundamental transformations are developed based on CA theory regarding decentralized computation for modeling different system’s behavior. The changes governing state transitions rely on simple evolution rules, which can easily be translated into functions using logic operators. A class of linear hybrid cellular automata (LHCA) based on rules 90 and 150 is used to implement these functions. Symmetric key systems theory is the foundation of the suggested algorithm. The algorithm functions use the proprieties provided by the LHCA evolution in order to convert plain text into cipher text and vice versa, in each case starting from the same initial state of the system and performing the same number of steps for each operation. Cellular automata’s parallel information processing property, in addition to their regular and dynamical structure, makes hardware implementation of such schemes best suited for VLSI implementation. Testing of the proposed algorithm was performed by developing both software and hardware solutions. Hardware implementation of the presented cryptosystem was developed using VHDL hardware description language and a FPGA device (XILINX Spartan3E XC3S500E). Design and software simulations have been carried out using the C# programming language.

Funder

Unitatea Executiva Pentru Finantarea Invatamantului Superior a Cercetarii Dezvoltarii si Inovarii

Publisher

MDPI AG

Subject

General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)

Reference31 articles.

1. Von Neumann, J. (1966). Theory of Self-Reproducing Automata, University of Illinois.

2. Sipper, M. (2004). Evolution of Parallel Cellular Machines—The Cellular Programming Approach, Springer.

3. Cho, S.J., Choi, U.S., Kim, H.D., Hwang, Y.H., and Kim, J.G. (2008, January 23–26). Analysis of 90/150 Two Predecessor Nongroup Cellular Automata. Proceedings of the Cellular Automata, 8th International Conference on Cellular Automata for Research and Industry (ACRI ‘08), Yokohama, Japan.

4. Random Sequence Generation by Cellular Automata;Wolfram;Adv. Appl. Math.,1986

5. Kozlov, V., Tatashev, A., and Yashina, M. (2022). Elementary Cellular Automata as Invariant under Conjugation Transformation or Combination of Conjugation and Reflection Transformations, and Applications to Traffic Modeling. Mathematics, 10.

Cited by 10 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3