Abstract
Cellular automata (CA) based cryptosystem has been studied for almost three decades, yet most of previously reported researches focus on the symmetric key encryption schemes. Up to now, few CA based public key encryption scheme has been proposed. To fill the gap, in this paper, we propose a new public key encryption scheme based on layered cellular automata (LCA). Specifically, in the proposed scheme, based on the T-shaped neighborhood structure, we combine four one-dimensional reversible CAs (set as the private key) to form the transition rules of a two-dimension CA, where the two-dimension CA is set as the corresponding public key. Based on the hardness assumption of the Decisional Dependent CA problem in LCA, we formally prove the proposed scheme is indistinguishably secure against the chosen-plaintext attack (IND-CPA). In addition, we also use a numeric example to demonstrate its feasibility. Finally, analysis of key space and time efficiency are also carried out along with RSA-1024, and the simulation results demonstrate that our proposed scheme is more efficient.
Highlights
As the explosive growth of information and communication technology (ICT) and its wide applications today, information security has become indispensable and crucial to the success of ICT
We propose a new public key encryption scheme based on Reversible cellular automata (RCA), which utilizes several one-dimensional (1D) RCAs to construct a two-dimensional (2D) cellular automata (CA), the 1D CA set as the private key and the 2D CA set as the corresponding public key
A layered cellular automata (LCA) can be viewed as a highly parallel system that consists of layers and each layer consisting of rows of one-dimensional CA, the number of layers can be changed according to actual situation [13]
Summary
As the explosive growth of information and communication technology (ICT) and its wide applications today, information security has become indispensable and crucial to the success of ICT. Guan [14] proposes a public key encryption algorithm used non-homogeneous CA, and the security of this algorithm is based on the difficulty of solving a system of nonlinear polynomial equations He does not give any specifications like key-size, key generation procedure and real life examples [15]. Zhu et al [18] put forward a public key algorithm, which uses four one dimension RCA to build a Moore neighborhood two-dimensional CA The securities of these schemes are all based on the trapdoor function, which only achieves the one-way security. These schemes may not satisfy high level security requirements, i.e., secure against the chosen-plaintext attacks (CPA) [19] To fill this gap, in this paper, we will define a layered cellular automata (LCA) and derive a new hard Decisional Dependent-CA (D-DCA) problem from the 2D CA reversibility problem.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: KSII Transactions on Internet and Information Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
