.NET framework security
| Hi-index | 0.00 |
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 104 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.