scientific article; zbMATH DE number 7385042

MaRDI QIDQ5010296zbMATHFDO

Authors Sandip Karmakar, Dipanwita Roy Chowdhury

Publication date 25 August 2021

Full work available at URL http://www.oldcitypublishing.com/journals/jca-home/jca-issue-contents/jca-volume-13-number-1-2-2018/jca-13-1-2-p-145-158/

zbMATH Keywords

cellular automatacryptographypseudo-randomness\(d\)-monomial testcryptographic properties of cellular automatanon-uniform nonlinear CA

Mathematics Subject Classification ID

Cryptography (94A60) Cellular automata (computational aspects) (68Q80) Boolean functions (94D10)

Recommendations

• Nonuniform cellular automata for cryptography
• Achieving better security using nonlinear cellular automata as a cryptographic primitive
• Non-linear and non-group cellular automata chaining technique for cryptographic applications
• scientific article; zbMATH DE number 2043340
• \(d\)-monomial tests of nonlinear cellular automata for cryptographic design
• Generating cryptographically suitable non-linear maximum length cellular automata
• Designing cryptographically strong \(S\)-boxes with the use of cellular automata
• Cellular automaton cryptosystems
• scientific article; zbMATH DE number 2114007
• Secure and computationally efficient cryptographic primitive based on cellular automaton

Cited in

(19)

• A cryptographic and coding-theoretic perspective on the global rules of cellular automata
• Theory of Composing Non-linear Machines with Predictable Cyclic Structures
• Generating cryptographically suitable non-linear maximum length cellular automata
• Cryptographic properties of bipermutive cellular automata rules
• \(d\)-monomial tests of nonlinear cellular automata for cryptographic design
• Parallel Processing and Applied Mathematics
• Achieving better security using nonlinear cellular automata as a cryptographic primitive
• Non-linear and non-group cellular automata chaining technique for cryptographic applications
• Pseudo-random sequences, Boolean functions and cellular automata
• Cryptographically suitable maximum length cellular automata
• The cryptographic properties of von Neumann cellular automata
• scientific article; zbMATH DE number 2184880 (Why is no real title available?)
• Cryptographic properties of Boolean functions defining elementary cellular automata
• Synthesis of maximum length cellular automata with nonlinearity injections
• Advances on random sequence generation by uniform cellular automata
• Study of five-neighborhood linear hybrid cellular automata and their synthesis
• Propagation characteristics of the divergence of elementary cellular automata
• Nonuniform cellular automata for cryptography
• Designing conflict free cellular automata-based PRNG

This page was built for publication:

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