Comparison between cellular automata and linear feedback shift registers based pseudo-random number generators

Kokolakis, I.; Andreadis, Ioannis; Tsalides, Ph.

doi:10.1016/s0141-9331(97)00009-4

Cited by 19 publications

(14 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Most digital hardware solutions are based on LFSR or cellular automata (CA) [22]. Another approach takes advantage of large numbers stored in parallel [23].…”

Section: Generating the Bernoulli Lawmentioning

confidence: 99%

Reaction Diffusion and Chemotaxis for Decentralized Gathering on FPGAs

Girau

Torres-Huitzil

Vlassopoulos

et al. 2009

International Journal of Reconfigurable Computing

View full text Add to dashboard Cite

We consider here the feasibility of gathering multiple computational resources by means of decentralized and simple local rules. We study such decentralized gathering by means of a stochastic model inspired from biology: the aggregation of the Dictyostelium discoideum cellular slime mold. The environment transmits information according to a reaction-diffusion mechanism and the agents move by following excitation fronts. Despite its simplicity this model exhibits interesting properties of self-organization and robustness to obstacles. We first describe the FPGA implementation of the environment alone, to perform large scale and rapid simulations of the complex dynamics of this reaction-diffusion model. Then we describe the FPGA implementation of the environment together with the agents, to study the major challenges that must be solved when designing a fast embedded implementation of the decentralized gathering model. We analyze the results according to the different goals of these hardware implementations.

show abstract

“…Most digital hardware solutions are based on LFSR or cellular automata (CA) [22]. Another approach takes advantage of large numbers stored in parallel [23].…”

Section: Generating the Bernoulli Lawmentioning

confidence: 99%

Reaction Diffusion and Chemotaxis for Decentralized Gathering on FPGAs

Girau

Torres-Huitzil

Vlassopoulos

et al. 2009

International Journal of Reconfigurable Computing

View full text Add to dashboard Cite

show abstract

“…[5, 7, 8,13,18,27,37]. A large number of research papers study the chaos dynamics in ECAs [2,15,22,28,39].…”

Section: Introductionmentioning

confidence: 99%

“…In [18], CAs attained higher speed and "reduced area occupancy in the silicon area" [18] compared to the LFSRs with identical characteristic polynomials. Summarized data on the PRNGs are given in Table 1.…”

Section: Introductionmentioning

confidence: 99%

“…A large number of research papers study the chaos dynamics in ECAs [2,15,22,28,39]. PRNG characteristics for the Maximum Length Group CAs (MaxCAs) were explored in details [5, 7, 8] and MaxCAs were suggested as PRNGs in BISTs [5,13,18] and data security applications [5,27].On the other hand, a novel fCA and fCA based PRNGs were recommended in [35] [3] and argued "a strong connection between them by focusing on two properties: density conservation and additivity" [3]. This is one of the reasons why we restricted the study in Section 3-5 to CAs only.…”

mentioning

confidence: 99%

“…PRNG characteristics for the Maximum Length Group CAs (MaxCAs) were explored in details [5, 7, 8] and MaxCAs were suggested as PRNGs in BISTs [5,13,18] and data security applications [5,27].…”

mentioning

confidence: 99%

See 2 more Smart Citations

On the Selection of Cellular Automata based PRNG in Code Division Multiple Access Communications

Mitra¹

2016

SIC

View full text Add to dashboard Cite

Abstract:The main contribution of this article is to investigate the application suitability of Cellular Automata based pseudo-random noise generator in Code Division Multiple Access Communications. New dynamics in group Cellular Automata were explored. Extensive analysis for two classes of group Cellular Automata (maximum length Cellular Automata and equal length Cellular Automata) were carried out. The analysis and comparison results for these classes of group Cellular Automata demonstrate the advantages of equal length Cellular Automata over maximum length Cellular Automata in view of code division multiple access applications. Keywords: Pseudo-Random Noise Generator, Linear Feed Back Shift Register, Coupled Map Lattice, Cellular Automata, Code Division Multiple Access.example, the discretized CMLs consisting of skew tent maps were defined as [12],where the number of sites is L, z 1, n ∈(0,1) present the state variable (real valued) for the site i at time n (=0,1,...), coupling constant is ε∈(0,1) with skew tent map is as [42],where parameter p ∈(0,1) .Stream cipher generation using CMLs along with computation of largest linear correlations between consecutive key streams, which is below the safe bounds, were introduced in [42]. Equal length tent maps (ELTM) (with analogy to ELCAs) and binary tent maps (BTM) based BIST applications were presented in [34]. The BTM was defined as [34],Stability issues and enhanced pattern formation in CMLs using fuzzy nodes towards information security were put forward in [30]. CfMLs are efficient in processing of uncertainty in information. Necessary conditions for periodicity, conditions for the minimal number of iterations in simulations of CfMLs, and validation of results (for both of CMLs and CfMLs) were discussed in [21]. Chaos-based PRNGs were introduced in many papers, e.g., [8,29]. The drawback for this class of PRNGs is the requirement for digitization for the uses in digital systems.Many PRNGs for BISTs use LFSRs. Multiplepolynomial LFSRs (MP-LFSRs) based PRNGs for BISTs were established in [12]. LFSR-PRNGs aiming reduced circuitry in BISTs were demonstrated in [17]. In an another design, LFSR-PRNGs with self reseeding capacity were shown to produce longer pseudo-random sequences with minimal logic [9]. An example of LFSR-based low-cost BIST architecture with low silicon area overhead was described in [20].CAs (specifically group CAs) were suggested as PRNGs in data security and BISTs applications. [5, 7, 8,13,18,27,37]. A large number of research papers study the chaos dynamics in ECAs [2,15,22,28,39]. PRNG characteristics for the Maximum Length Group CAs (MaxCAs) were explored in details [5, 7, 8] and MaxCAs were suggested as PRNGs in BISTs [5,13,18] and data security applications [5,27].On the other hand, a novel fCA and fCA based PRNGs were recommended in [35] [3] and argued "a strong connection between them by focusing on two properties: density conservation and additivity" [3]. This is one of the reasons why we restricted the study in Section 3-5 to CAs on...

show abstract

A fast pseudo-stochastic sequential cipher generator based on RBMs

Peng

et al. 2016

Neural Comput & Applic

View full text Add to dashboard Cite

Based on Restricted Boltzmann Machines (RBMs), an improved pseudo-stochastic sequential cipher generator is proposed. It is effective and efficient because of the two advantages: this generator includes a stochastic neural network that can perform the calculation in parallel, that is to say, all elements are calculated simultaneously; unlimited number of sequential ciphers can be generated simultaneously for multiple encryption schemas. The periodicity and the correlation of the output sequential ciphers meet the requirements for the design of encrypting s equential data. In the experiment, the generated sequential cipher is used to encrypt the image, and better performance is achieved in terms of the key space analysis, the correlation analysis, the sensitivity analysis and the differential attack. The expe rimental result is promising that could promote the development of image protection in computer security. IntroductionIn the field of communication and encryption for sequential data, sequential cipher generation algorithms have been one of the main technology used for military and diplomatic occasions. As a kind of symmetric encryption algorithm, sequential ciphers have the following characteristics: easy to be implemented , simple implementation with hardware, fast in encryption and decryption processing, none or limited error propagation. Shannon proved the one-time pad encryption system was safe [1]. It plays an important role in promoting the development of the sequential ciphering technology. The development of the sequential cipher technology has been attempting to imitate the one-time pad scheme, i.e., the one-time pad encryption system is the prototype of the sequential ciphering system. In order to cipher the sequential data, a stochastic sequence, determined by a cipher code, will be generated at first. The algorithms of generating stochastic sequential ciphers can be roughly divided into two categories: Linear Fee dback Shift Register sequential cipher generators (LFSR) and nonlinear sequential cipher generators. LFSR

show abstract

Comparison between cellular automata and linear feedback shift registers based pseudo-random number generators

Cited by 19 publications

References 13 publications

Reaction Diffusion and Chemotaxis for Decentralized Gathering on FPGAs

Reaction Diffusion and Chemotaxis for Decentralized Gathering on FPGAs

On the Selection of Cellular Automata based PRNG in Code Division Multiple Access Communications

A fast pseudo-stochastic sequential cipher generator based on RBMs

Contact Info

Product

Resources

About