Non-linear Hybrid Cellular Automata as Pseudorandom Pattern Generators for VLSI Systems
نویسندگان
چکیده
منابع مشابه
Graphic Cryptography with Pseudorandom Bit Generators and Cellular Automata
In this paper we propose a new graphic symmetrical cryptosystem in order to encrypt a colored image defined by pixels and by any number of colors. This cryptosystem is based on a reversible bidimensional cellular automaton and uses a pseudorandom bit generator. As the key of the cryptosystem is the seed of the pseudorandom bit generator, the latter has to be cryptographically secure. Moreover, ...
متن کاملComparison between 2D cellular automata based pseudorandom number generators
Pseudorandom number generators (PRNGs) should satisfy two main criteria, high randomness quality and fast computation of a sequence of numbers. In this paper, a comparative study of twodimensional Cellular Automata (CA) based PRNGs is performed to evaluate the randomness quality and the hardware constraints involved in terms of configuration parameters such as, transition rules, neighborhoods a...
متن کاملThe Use of Linear Hybrid Cellular Automata as Pseudo Random Bit Generators in Cryptography
The main goal of this paper is to study the behaviour of a particular type of hybrid cellular automata, as cryptographically secure pseudorandom bit generators. The hybrid cellular automata considered have been passed the statistical tests de ned in the cryptographic literature to study the security of the sequences generated for cryptographic purposes: frequency test, serial test, poker test, ...
متن کاملLayered Cellular Automata for Pseudorandom Number Generation
The proposed Layered Cellular Automata (L-LCA), which comprises of a main CA with L additional layers of memory registers, has simple local interconnections and high operating speed. The time-varying L-LCA transformation at each clock can be reduced to a single transformation in the set { | 1, 2, , 2 1} f n A f = − ... formed by the transformation matrix A of a maximum length Cellular Automata ...
متن کاملConfigurable Cellular Automata for Pseudorandom Number Generation
This paper proposes a generalized structure of cellular automata (CA) – the configurable cellular automata (CoCA). With selected properties from programmable CA (PCA) and controllable CA (CCA), a new approach to cellular automata is developed. In CoCA, the cells are dynamically reconfigured at run-time via a control CA. Reconfiguration of a cell simply means varying the properties of that cell ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: VLSI Design
سال: 1998
ISSN: 1065-514X,1563-5171
DOI: 10.1155/1998/87186