Generating PNS for Secret Key Cryptography Using Cellular Automaton
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2011, Vol 2, Issue 5
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 nonuniform 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.
Authors and Affiliations
Bijayalaxmi Kar , D. Chandrasekhra Rao , Dr. Amiya Kumar Rath
Keywords
Related Articles
- EP ID EP160649
- DOI -
- Views 100
- Downloads 0
A Synchronous Stream Cipher Generator Based on Quadratic Fields (SSCQF)
In this paper, we propose a new synchronous stream cipher called SSCQF whose secret-key is Ks=(z1,...zn) where zi is a positive integer. Let d1, d2,..., dN be N positive integers in {0,1,...2m -1} such that di=zi mod2m w...
An Algorithm Research for Supply Chain Management Optimization Model
In this paper, we consider the extended linear complementarity problem on supply chain management optimization model. We first give a global error bound for the extended linear complementarity problem, and then propose a...
Expensive Optimisation: A Metaheuristics Perspective
Stochastic, iterative search methods such as Evolutionary Algorithms (EAs) are proven to be efficient optimizers. However, they require evaluation of the candidate solutions which may be prohibitively expensive in many r...
Heuristics Applied to Mutation Testing in an Impure Functional Programming Language
The task of elaborating accurate test suites for pro-gram testing can be an extensive computational work. Mutation testing is not immune to the problem of being a computational and time-consuming task so that it has foun...
Linear Intensity-Based Image Registration
The accurate detection and localization of lesion within the prostate could greatly benefit in the planning of surgery and radiation therapy. Although T2 Weighted Imaging (T2WI) Magnetic Resonance Imaging (MRI) provides...