A new public key encryption scheme based on layered cellular automata

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 publ...

Full description

Saved in:
Bibliographic Details
Main Authors: Zhang, Xing, Zhang, Hong, Xu, Chungen, Lu, Rongxing
Other Authors: School of Electrical and Electronic Engineering
Format: Article
Language:English
Published: 2019
Subjects:
Online Access:https://hdl.handle.net/10356/105077
http://hdl.handle.net/10220/50030
http://dx.doi.org/10.3837/tiis.2014.10.017
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-105077
record_format dspace
spelling sg-ntu-dr.10356-1050772019-12-06T21:45:45Z A new public key encryption scheme based on layered cellular automata Zhang, Xing Zhang, Hong Xu, Chungen Lu, Rongxing School of Electrical and Electronic Engineering Public Key Encryption Reversible Cellular Automata Engineering::Electrical and electronic engineering 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. MOE (Min. of Education, S’pore) Published version 2019-09-30T01:45:14Z 2019-12-06T21:45:45Z 2019-09-30T01:45:14Z 2019-12-06T21:45:45Z 2014 Journal Article Zhang, X., Lu, R., Zhang, H., & Xu, C. (2014). A new public key encryption scheme based on layered cellular automata. KSII Transactions on Internet and Information Systems, 8(10), 3572-3590. doi:10.3837/tiis.2014.10.017 https://hdl.handle.net/10356/105077 http://hdl.handle.net/10220/50030 http://dx.doi.org/10.3837/tiis.2014.10.017 en KSII Transactions on Internet and Information Systems © 2014 KSII. This is an open-access article distributed under the terms of the Creative Commons Attribution License. 19 p. application/pdf
institution Nanyang Technological University
building NTU Library
country Singapore
collection DR-NTU
language English
topic Public Key Encryption
Reversible Cellular Automata
Engineering::Electrical and electronic engineering
spellingShingle Public Key Encryption
Reversible Cellular Automata
Engineering::Electrical and electronic engineering
Zhang, Xing
Zhang, Hong
Xu, Chungen
Lu, Rongxing
A new public key encryption scheme based on layered cellular automata
description 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.
author2 School of Electrical and Electronic Engineering
author_facet School of Electrical and Electronic Engineering
Zhang, Xing
Zhang, Hong
Xu, Chungen
Lu, Rongxing
format Article
author Zhang, Xing
Zhang, Hong
Xu, Chungen
Lu, Rongxing
author_sort Zhang, Xing
title A new public key encryption scheme based on layered cellular automata
title_short A new public key encryption scheme based on layered cellular automata
title_full A new public key encryption scheme based on layered cellular automata
title_fullStr A new public key encryption scheme based on layered cellular automata
title_full_unstemmed A new public key encryption scheme based on layered cellular automata
title_sort new public key encryption scheme based on layered cellular automata
publishDate 2019
url https://hdl.handle.net/10356/105077
http://hdl.handle.net/10220/50030
http://dx.doi.org/10.3837/tiis.2014.10.017
_version_ 1681034039788568576