Simulator for Testing Cellular Automata Cryptographic Algorithms
نویسندگان
چکیده
This paper presents, a simulator that aims the development and design of cellular-automata based cryptographic algorithms. This software is necessary mainly in order to choose a (large) set of local rules as possible keys that should be integrated in hardware. The software accepts linear and two-dimensional cellular automata having variable dimensions, limited to 100/100 cells (that gives a maximum of 10 bits for two-dimensional encryption algorithms). In addition to the cellular automata simulation, the software completely emulates the algorithms for encryption and decryption. The software is an efficient tool for empirical analysis as well as statistic studies of all stages of the cryptographic schemes. An attractive software facility is the computation of the map of the basins of attractions, which stands only for small dimension linear cellular automata but can be qualitatively extrapolated for larger systems having the same rule.
منابع مشابه
A CELLULAR AUTOMATA BASED FIREFLY ALGORITHM FOR LAYOUT OPTIMIZAION OF TRUSS STRUCTURES
In this study an efficient meta-heuristic is proposed for layout optimization of truss structures by combining cellular automata (CA) and firefly algorithm (FA). In the proposed meta-heuristic, called here as cellular automata firefly algorithm (CAFA), a new equation is presented for position updating of fireflies based on the concept of CA. Two benchmark examples of truss structures are presen...
متن کاملDesign and Implementation of Area Efficient Cellular Automata for Efficient Cryptography
A novel cryptographic algorithm mainly depends on the cellular automata .In order to get the randomness using cellular automata concept. In this algorithm we have mainly concentrated on cellular automata module we have 8 different rules for different rounds .In previous algorithm the message and key size was 128bit, but in this project to eliminate all the unnecessary logic operations present i...
متن کاملRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملSimulation of Future Land Use Map of the Catchment Area, with the Integration of Cellular Automata and Markov Chain Models Based on Selection of the Best Classification Algorithm: A Case Study of Fakhrabad Basin of Mehriz, Yazd
INTRODUCTION Since the land use change affects many natural processes including soil erosion and sediment yield, floods and soil degradation and the chemical and physical properties of soil, so, different aspects of land use changes in the past and future should be considered particularly in the planning and decision-making. One of the most important applications of remote sensing is land ...
متن کاملDesign of cybernetic metamodel of cryptographic algorithms and ranking of its supporting components using ELECTRE III method
Nowadays, achieving desirable and stable security in networks with national and organizational scope and even in sensitive information systems, should be based on a systematic and comprehensive method and should be done step by step. Cryptography is the most important mechanism for securing information. a cryptographic system consists of three main components: cryptographic algorithms, cryptogr...
متن کامل