RADG Modification with Different Values of States

Abstract

Abstract Cryptography may be a science of changing messages into unclear kind through the employment of encoding algorithms that is an algorithm that converts the text to a cypher and increased by arithmetic that shield information in powerful ways. A novel keyless security theme Reaction Automata Direct Graph (RADG), that relies on automata direct graph and reaction states. The novelty of RADG lies within the incontrovertible fact that it doesn’t need any key to perform the cryptographically operations therefore creating it a possible scheme for big wireless systems. Chaotic maps represent the backgrounds for chaos based mostly cryptography thanks to the actual fact that chaotic transformations are sensitive to changes within the initial conditions and generate solutions similar to random ones. In this paper a proposed modification to RADG will be performed. The main problem of the RADG is that the values in the states are static. In this paper this problem will be solved using chaos logistic map. The RADG which is used in this paper is key not keyless (by using chaos logistic map).