Abstract

The paper presents new results concerning application of cellular automata (CAs) to the secret key using vernam cipher cryptography.CA are applied to generate pseudo-random numbers sequence (PNS) which is used during the encryption process. One dimensional, non-uniform CAs is considered as a generator of pseudorandom number sequences (PNSs) used in cryptography with the secret key. The quality of PNSs highly depends on a set of applied CA rules. Rules of radius r = 1 and 2 for non-uniform one dimensional CAs have been considered. The search of rules is performed with use of evolutionary technique called cellular programming. As the result of collective behavior of discovered set of CA rules very high quality PNSs are generated. The quality of PNSs outperforms the quality of known one dimensional CA-based PNS generators used in the secret key cryptography. The extended set of CA rules which was found makes the cryptography system much more resistant on breaking a cryptography key.

Highlights

  • Confidentiality is mandatory for a majority of network applications for example commercial uses of the internet

  • Two classes of algorithms exist on the market for Data encryption: secret key systems and public key systems

  • In the paper we have reported results of the study on applying CAs to the secret key cryptography

Read more

Summary

INTRODUCTION

Confidentiality is mandatory for a majority of network applications for example commercial uses of the internet. Cellular automata are highly parallel and distributed systems which are able to perform complex computations New perspectives in this area have been opened when evolutionary techniques appeared and have been used to design automatically CA based system. In the context of secret key systems, CA were first studied by wolfram [17], and later by Nandi et al [20] and Gutowitz [8] They were a subject of study by Tomassini and his colleagues [12]. This paper extends these recent studies and describes the application of one-dimensional (1D) CAs for the secret key cryptography.

VERNAM CIPHER AND SECRET KEY CRYPTOGRAPHY
CELLULAR AUTOMATA AND CRYPTOGRAPHY
Cellular programming
Evaluate fitness function of each rule
ANALYSIS AND COMPARISON OF RESULTS
CONCLUSIONS

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 call

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.