Advances on random sequence generation by uniform cellular automata

E Formenti, K Imai, B Martin, JB Yunès - … dedicated to jozef gruska on the …, 2014 - Springer
The study of cellular automata rules suitable for cryptographic applications is under
consideration. On one hand, cellular automata can be used to generate pseudo-random …

d-Monomial Tests of Nonlinear Cellular Automata for Cryptographic Design

S Karmakar, D Mukhopadhyay… - Cellular Automata: 9th …, 2010 - Springer
Pseudorandom generation is a key to any cryptographic application. Linear Cellular
Automata are known as good pseudorandom generators. However, for cryptographic …

Leakage squeezing using cellular automata

S Karmakar, D Roy Chowdhury - … September 17-19, 2013. Proceedings 19, 2013 - Springer
Leakage squeezing is a novel approach towards resisting side channel attacks against
cryptographic implementations. It is seen that certain codes are ideal for leakage squeezing …

Achieving better security using nonlinear cellular automata as a cryptographic primitive

S Maiti, D Roy Chowdhury - … , ICMC 2018, Varanasi, India, January 9-11 …, 2018 - Springer
Nonlinear functions are essential in different crypto-primitives as they play an important role
on the security of a cipher design. Wolfram identified Rule 30 as a powerful nonlinear …

Investigating four neighbourhood cellular automata as better cryptographic primitives

J Jose, DR Chowdhury - Journal of Discrete Mathematical …, 2017 - Taylor & Francis
Abstract Three-neighbourhood Cellular Automata (CA) are widely studied and accepted as
suitable cryptographic primitive. Rule 30, a 3-neighbourhood nonlinear CA rule, was …

New hybrid CA rule sets for cryptographic design

G Maity, J Bhaumik - … of the 2015 Third International Conference …, 2015 - ieeexplore.ieee.org
In this paper five hybrid CA rule sets are proposed which are well suited for cryptographic
design. The cryptographic properties such as nonlinearity, balancedness, resiliency, number …

Four neighbourhood cellular automata as better cryptographic primitives

J Jose, D RoyChowdhury - Cryptology ePrint Archive, 2015 - eprint.iacr.org
Abstract Three-neighbourhood Cellular Automata (CA) are widely studied and accepted as
suitable cryptographic primitive. Rule 30, a 3-neighbourhood CA rule, was proposed as an …

[PDF][PDF] On 1-resilient, radius 2 elementary CA rules

E Formenti, K Imai, B Martin, JB Yunes - AUTOMATA 2011, 2011 - inria.hal.science
The study of cellular automata rules suitable for cryptographic applications is under
consideration. Cellular automata can be used to generate pseudo-random sequences as …

Synthesis of Maximum Length Cellular Automata with Nonlinearity Injections.

S Maiti, DR Chowdhury - Journal of Cellular Automata, 2021 - search.ebscohost.com
Nonlinear functions are essential in different crypto primitives as they play an important role
in the security of cryptosystems. In literature, elementary nonlinear Cellular Automata (CA) …

Etude et Implémentation des Fonctions de Hachage Cryptographiques Basées sur les Automates Cellulaires

BA Eddine - 2016 - dspace.univ-sba.dz
Résumé (Français et/ou Anglais): Les fonctions de hachage cryptographiques sont des
primitives importantes pour construire de nombreux systèmes de sécurité tels que les …