Cryptographically suitable maximum length cellular automata

MaRDI QIDQ5388998zbMATH OpenFDO

Authors Sourav Das, Dipanwita Roychowdhury

Publication date 24 April 2012

zbMATH Keywords

cryptographymaximum length cellular automatanon-linearitypseudo-random number generator

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Cryptography (94A60)

Recommendations

• Generating cryptographically suitable non-linear maximum length cellular automata
• Maximum length cellular automaton sequences and its application
• scientific article; zbMATH DE number 7385042
• Maximum-length sequences, cellular automata, and random numbers
• Advances on random sequence generation by uniform cellular automata

Cited in

(7)

• Maximum length cellular automaton sequences and its application
• Maximum-length sequences, cellular automata, and random numbers
• An Efficient n ×n Boolean Mapping Using Additive Cellular Automata
• Nonlinear Pseudorandom Sequences Based on 90/150 LHGCA
• Generating cryptographically suitable non-linear maximum length cellular automata
• Synthesis of maximum length cellular automata with nonlinearity injections
• A survey of cellular automata: types, dynamics, non-uniformity and applications

This page was built for publication: Cryptographically suitable maximum length cellular automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5388998)