CARPenter: A Cellular Automata Based Resilient Pentavalent Stream Cipher

Lakra, Rohit; John, Anita; Jose, Jimmy

doi:10.1007/978-3-319-99813-8_32

Cited by 7 publications

(5 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, relying only on the dynamical properties of CA is usually not sufficient to realize a sound cryptographic primitive, since reasonable levels of security often require much more stringent criteria than those studied in the field of dynamical systems, such as sensitivity to initial conditions (Kurka 2003). This has been the case with the first proposal to employ CA for cryptographic applications, namely Wolfram's pseudorandom generator (1986).…”

Section: Related Workmentioning

confidence: 99%

Heuristic search of (semi-)bent functions based on cellular automata

et al. 2022

View full text Add to dashboard Cite

An interesting thread in the research of Boolean functions for cryptography and coding theory is the study of secondary constructions: given a known function with a good cryptographic profile, the aim is to extend it to a (usually larger) function possessing analogous properties. In this work, we continue the investigation of a secondary construction based on cellular automata (CA), focusing on the classes of bent and semi-bent functions. We prove that our construction preserves the algebraic degree of the local rule, and we narrow our attention to the subclass of quadratic functions, performing several experiments based on exhaustive combinatorial search and heuristic optimization through Evolutionary Strategies (ES). Finally, we classify the obtained results up to permutation equivalence, remarking that the number of equivalence classes that our CA-XOR construction can successfully extend grows very quickly with respect to the CA diameter.

show abstract

Section: Related Workmentioning

confidence: 99%

Heuristic search of (semi-)bent functions based on cellular automata

et al. 2022

View full text Add to dashboard Cite

show abstract

“…The NIST suite consists of 15 tests, and each test can be comprised of many subtests, which is why the suite is sometimes listed as having 15 tests [Lakra et al (2018)] and in other times as being a set of 188 or more tests [Manzoni and Mariot (2018)].…”

Section: Nist Prng Statistical Test Suitementioning

confidence: 99%

A reversible system based on hybrid toggle radius-4 cellular automata and its application as a block cipher

Lira¹,

Macêdo²,

Lima³

et al. 2021

Preprint

View full text Add to dashboard Cite

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.Keywords cellular automata • reversibility • cryptography • block cipher

show abstract

“…Leporati et al [18] focused on the class of bipermutive rules (which are known to induce chaotic CA) and performed a combinatorial search of highly nonlinear correlation-immune rules of diameter 5 and 7. The three best rules of diameter 5 that passed all tests of the NIST suite [1] in that work were later selected to design the nonlinear components of the CARPenter [17] and Pentavium [14] CA-based stream ciphers.…”

Section: Related Workmentioning

confidence: 99%

Heuristic Search of (Semi-)Bent Functions based on Cellular Automata

Mariot¹,

Saletta²,

Leporati³

et al. 2021

Preprint

View full text Add to dashboard Cite

An interesting thread in the research of Boolean functions for cryptography and coding theory is the study of secondary constructions: given a known function with a good cryptographic profile, the aim is to extend it to a (usually larger) function possessing analogous properties. In this work, we continue the investigation of a secondary construction based on cellular automata, focusing on the classes of bent and semi-bent functions. We prove that our construction preserves the algebraic degree of the local rule, and we narrow our attention to the subclass of quadratic functions, performing several experiments based on exhaustive combinatorial search and heuristic optimization through Evolutionary Strategies (ES). Finally, we classify the obtained results up to permutation equivalence, remarking that the number of equivalence classes that our CA-XOR construction can successfully extend grows very quickly with respect to the CA diameter.

show abstract

CARPenter: A Cellular Automata Based Resilient Pentavalent Stream Cipher

Cited by 7 publications

References 10 publications

Heuristic search of (semi-)bent functions based on cellular automata

Heuristic search of (semi-)bent functions based on cellular automata

A reversible system based on hybrid toggle radius-4 cellular automata and its application as a block cipher

Heuristic Search of (Semi-)Bent Functions based on Cellular Automata

Contact Info

Product

Resources

About