774 research outputs found
A reversible system based on hybrid toggle radius-4 cellular automata and its application as a block cipher
The dynamical system described herein uses a hybrid cellular automata (CA)
mechanism to attain reversibility, and this approach is adapted to create a
novel block cipher algorithm called HCA. CA are widely used for modeling
complex systems and employ an inherently parallel model. Therefore,
applications derived from CA have a tendency to fit very well in the current
computational paradigm where scalability and multi-threading potential are
quite desirable characteristics. HCA model has recently received a patent by
the Brazilian agency INPI. Several evaluations and analyses performed on the
model are presented here, such as theoretical discussions related to its
reversibility and an analysis based on graph theory, which reduces HCA security
to the well-known Hamiltonian cycle problem that belongs to the NP-complete
class. Finally, the cryptographic robustness of HCA is empirically evaluated
through several tests, including avalanche property compliance and the NIST
randomness suite.Comment: 34 pages, 12 figure
Revisiting LFSMs
Linear Finite State Machines (LFSMs) are particular primitives widely used in
information theory, coding theory and cryptography. Among those linear
automata, a particular case of study is Linear Feedback Shift Registers (LFSRs)
used in many cryptographic applications such as design of stream ciphers or
pseudo-random generation. LFSRs could be seen as particular LFSMs without
inputs.
In this paper, we first recall the description of LFSMs using traditional
matrices representation. Then, we introduce a new matrices representation with
polynomial fractional coefficients. This new representation leads to sparse
representations and implementations. As direct applications, we focus our work
on the Windmill LFSRs case, used for example in the E0 stream cipher and on
other general applications that use this new representation.
In a second part, a new design criterion called diffusion delay for LFSRs is
introduced and well compared with existing related notions. This criterion
represents the diffusion capacity of an LFSR. Thus, using the matrices
representation, we present a new algorithm to randomly pick LFSRs with good
properties (including the new one) and sparse descriptions dedicated to
hardware and software designs. We present some examples of LFSRs generated
using our algorithm to show the relevance of our approach.Comment: Submitted to IEEE-I
Recommended from our members
Permutation and sampling with maximum length CA for pseudorandom number generation
In this paper, we study the effect of dynamic permutation and sampling on the randomness quality of sequences generated by cellular automata (CA). Dynamic permutation and sampling have not been explored in previous CA work and a suitable implementation is shown using a two CA model. Three different schemes that incorporate these two operations are suggested - Weighted Permutation Vector Sampling with Controlled Multiplexing, Weighted Permutation Vector Sampling with Irregular Decimation and Permutation Programmed CA Sampling. The experiment results show that the resulting sequences have varying degrees of improvement in DIEHARD results and linear complexity compared to the CA
Pseudorandom sequence generation using binary cellular automata
Tezin basılısı İstanbul Şehir Üniversitesi Kütüphanesi'ndedir.Random numbers are an integral part of many applications from computer simulations,
gaming, security protocols to the practices of applied mathematics and physics. As
randomness plays more critical roles, cheap and fast generation methods are becoming a
point of interest for both scientific and technological use.
Cellular Automata (CA) is a class of functions which attracts attention mostly due to the
potential it holds in modeling complex phenomena in nature along with its discreteness
and simplicity. Several studies are available in the literature expressing its potentiality
for generating randomness and presenting its advantages over commonly used random
number generators.
Most of the researches in the CA field focus on one-dimensional 3-input CA rules. In
this study, we perform an exhaustive search over the set of 5-input CA to find out the
rules with high randomness quality. As the measure of quality, the outcomes of NIST
Statistical Test Suite are used.
Since the set of 5-input CA rules is very large (including more than 4.2 billions of rules),
they are eliminated by discarding poor-quality rules before testing.
In the literature, generally entropy is used as the elimination criterion, but we preferred
mutual information. The main motive behind that choice is to find out a metric for
elimination which is directly computed on the truth table of the CA rule instead of the
generated sequence. As the test results collected on 3- and 4-input CA indicate, all rules
with very good statistical performance have zero mutual information. By exploiting this
observation, we limit the set to be tested to the rules with zero mutual information. The
reasons and consequences of this choice are discussed.
In total, more than 248 millions of rules are tested. Among them, 120 rules show out-
standing performance with all attempted neighborhood schemes. Along with these tests,
one of them is subjected to a more detailed testing and test results are included.
Keywords: Cellular Automata, Pseudorandom Number Generators, Randomness TestsContents
Declaration of Authorship ii
Abstract iii
Öz iv
Acknowledgments v
List of Figures ix
List of Tables x
1 Introduction 1
2 Random Number Sequences 4
2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
2.2 Theoretical Approaches to Randomness . . . . . . . . . . . . . . . . . . . 5
2.2.1 Information Theory . . . . . . . . . . . . . . . . . . . . . . . . . . 5
2.2.2 Complexity Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
2.2.3 Computability Theory . . . . . . . . . . . . . . . . . . . . . . . . . 6
2.3 Random Number Generator Classification . . . . . . . . . . . . . . . . . . 7
2.3.1 Physical TRNGs . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
2.3.2 Non-Physical TRNGs . . . . . . . . . . . . . . . . . . . . . . . . . 9
2.3.3 Pseudorandom Number Generators . . . . . . . . . . . . . . . . . . 10
2.3.3.1 Generic Design of Pseudorandom Number Generators . . 10
2.3.3.2 Cryptographically Secure Pseudorandom Number Gener- ators . . . . . . . . . . . . . .11
2.3.4 Hybrid Random Number Generators . . . . . . . . . . . . . . . . . 13
2.4 A Comparison between True and Pseudo RNGs . . . . . . . . . . . . . . . 14
2.5 General Requirements on Random Number Sequences . . . . . . . . . . . 14
2.6 Evaluation Criteria of PRNGs . . . . . . . . . . . . . . . . . . . . . . . . . 16
2.7 Statistical Test Suites . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
2.8 NIST Test Suite . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18
2.8.1 Hypothetical Testing . . . . . . . . . . . . . . . . . . . . . . . . . . 18
2.8.2 Tests in NIST Test Suite . . . . . . . . . . . . . . . . . . . . . . . . 20
2.8.2.1 Frequency Test . . . . . . . . . . . . . . . . . . . . . . . . 20
2.8.2.2 Block Frequency Test . . . . . . . . . . . . . . . . . . . . 20
2.8.2.3 Runs Test . . . . . . . . . . . . . . . . . . . . . . . . . . . 21
2.8.2.4 Longest Run of Ones in a Block . . . . . . . . . . . . . . 21
2.8.2.5 Binary Matrix Rank Test . . . . . . . . . . . . . . . . . . 21
2.8.2.6 Spectral Test . . . . . . . . . . . . . . . . . . . . . . . . . 22
2.8.2.7 Non-overlapping Template Matching Test . . . . . . . . . 22
2.8.2.8 Overlapping Template Matching Test . . . . . . . . . . . 22
2.8.2.9 Universal Statistical Test . . . . . . . . . . . . . . . . . . 23
2.8.2.10 Linear Complexity Test . . . . . . . . . . . . . . . . . . . 23
2.8.2.11 Serial Test . . . . . . . . . . . . . . . . . . . . . . . . . . 24
2.8.2.12 Approximate Entropy Test . . . . . . . . . . . . . . . . . 24
2.8.2.13 Cumulative Sums Test . . . . . . . . . . . . . . . . . . . . 24
2.8.2.14 Random Excursions Test . . . . . . . . . . . . . . . . . . 24
2.8.2.15 Random Excursions Variant Test . . . . . . . . . . . . . . 25
3 Cellular Automata 26 3.1 History of Cellular Automata . . . . . . . . . . . . . . . . . . . . . . . .26
3.1.1 von Neumann’s Work . . . . . . . . . . . . . . . . . . . . . . . . . 27
3.1.2 Conway’s Life . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
3.1.3 Wolfram’s Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
3.2 Cellular Automata and the Definitive Parameters . . . . . . . . . . . . . . 31
3.2.1 Lattice Geometry . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34
3.2.2 Cell Content . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
3.2.3 Guiding Rule . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
3.2.4 Neighborhood Scheme . . . . . . . . . . . . . . . . . . . . . . . . . 36
3.3 A Formal Definition of Cellular Automata . . . . . . . . . . . . . . . . . . 37
3.4 Elementary Rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39
3.5 Rule Families . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40
3.6 Producing Randomness via Cellular Automata . . . . . . . . . . . . . . . 42
3.6.1 CA-Based PRNGs . . . . . . . . . . . . . . . . . . . . . . . . . . . 42
3.6.2 Balancedness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44
3.6.3 Mutual Information . . . . . . . . . . . . . . . . . . . . . . . . . . 44
3.6.4 Entropy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45
4 Test Results 47 4.1 Output of a Statistical Test . . . . . . . . . . . . . . . . . . . . . . . . . . 48
4.2 Testing Strategy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48
4.3 Interpretation of the Test Results . . . . . . . . . . . . . . . . . . . . . . . 49
4.3.1 Rate of success over all trials . . . . . . . . . . . . . . . . . . . . . 49
4.3.2 Distribution of P-values . . . . . . . . . . . . . . . . . . . . . . . . 50
4.4 Testing over a big space of functions . . . . . . . . . . . . . . . . . . . . . 50
4.5 Our Procedure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51
4.6 Results and Observations . . . . . . . . . . . . . . . . . . . . . . . . . . . 52
4.6.1 Change in State Width . . . . . . . . . . . . . . . . . . . . . . . . 53
4.6.2 Change in Neighborhood Scheme . . . . . . . . . . . . . . . . . . . 53
4.6.3 Entropy vs. Statistical Quality . . . . . . . . . . . . . . . . . . . . 58
4.6.4 Mutual Information vs. Statistical Quality . . . . . . . . . . . . . . 60
4.6.5 Entropy vs. Mutual Information . . . . . . . . . . . . . . . . . . . 62
4.6.6 Overall Test Results of 4- and 5-input CA . . . . . . . . . . . . . . 6
4.7 The simplest rule: 1435932310 . . . . . . . . . . . . . . . . . . . . . . . . . 68
5 Conclusion 74
A Test Results for Rule 30 and Rule 45 77
B 120 Rules with their Shortest Boolean Formulae 80
Bibliograph
Optimal Rules Identification for a Random Number Generator Using Cellular Learning Automata
The cryptography is known as one of most essential ways for protecting information against threats. Among all encryption algorithms, stream ciphering can be indicated as a sample of swift ways for this purpose, in which, a generator is applied to produce a sequence of bits as the key stream. Although this sequence is seems to be random, severely, it contains a pattern that repeats periodically. Linear Feedback Shift Registers and cellular automata have been used as pseudo-random number generator. Some challenges such as error propagation and pattern dependability have motivated the designers to use CA for this purpose. The most important issue in using cellular automata includes determining an optimal set of rules for cells. This paper focuses on selecting optimal rules set for such this generator with using an open cellular learning automata, which is a cellular automata with learning capability and interacts with local and global environments
Cellular Automata in Cryptographic Random Generators
Cryptographic schemes using one-dimensional, three-neighbor cellular automata as a primitive have been put forth since at least 1985. Early results showed good statistical pseudorandomness, and the simplicity of their construction made them a natural candidate for use in cryptographic applications. Since those early days of cellular automata, research in the field of cryptography has developed a set of tools which allow designers to prove a particular scheme to be as hard as solving an instance of a well-studied problem, suggesting a level of security for the scheme. However, little or no literature is available on whether these cellular automata can be proved secure under even generous assumptions. In fact, much of the literature falls short of providing complete, testable schemes to allow such an analysis. In this thesis, we first examine the suitability of cellular automata as a primitive for building cryptographic primitives. In this report, we focus on pseudorandom bit generation and noninvertibility, the behavioral heart of cryptography. In particular, we focus on cyclic linear and non-linear automata in some of the common configurations to be found in the literature. We examine known attacks against these constructions and, in some cases, improve the results. Finding little evidence of provable security, we then examine whether the desirable properties of cellular automata (i.e. highly parallel, simple construction) can be maintained as the automata are enhanced to provide a foundation for such proofs. This investigation leads us to a new construction of a finite state cellular automaton (FSCA) which is NP-Hard to invert. Finally, we introduce the Chasm pseudorandom generator family built on this construction and provide some initial experimental results using the NIST test suite
Pseudorandom number generation based on controllable cellular automata
A novel Cellular Automata (CA) Controllable CA (CCA) is proposed in this paper. Further, CCA are applied in Pseudorandom Number Generation. Randomness test results on CCA Pseudorandom Number Generators (PRNGs) show that they are better than 1-d CA PRNGs and can be comparable to 2-d ones. But they do not lose the structure simplicity of 1-d CA. Further, we develop several different types of CCA PRNGs. Based on the comparison of the randomness of different CCA PRNGs, we find that their properties are decided by the actions of the controllable cells and their neighbors. These novel CCA may be applied in other applications where structure non-uniformity or asymmetry is desired
- …