scientific article; zbMATH DE number 7385042
From MaRDI portal
Publication:5010296
zbMATH Open1467.94036MaRDI QIDQ5010296FDOQ5010296
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/
Title of this publication is not available (Why is that?)
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
cellular automatacryptographypseudo-randomness\(d\)-monomial testcryptographic properties of cellular automatanon-uniform nonlinear CA
Cited In (19)
- Cryptographic properties of Boolean functions defining elementary cellular automata
- Cryptographically suitable maximum length cellular automata
- Synthesis of maximum length cellular automata with nonlinearity injections
- Non-linear and non-group cellular automata chaining technique for cryptographic applications
- \(d\)-monomial tests of nonlinear cellular automata for cryptographic design
- Advances on random sequence generation by uniform cellular automata
- Title not available (Why is that?)
- Pseudo-random sequences, Boolean functions and cellular automata
- The cryptographic properties of von Neumann cellular automata
- A cryptographic and coding-theoretic perspective on the global rules of cellular automata
- Cryptographic properties of bipermutive cellular automata rules
- Theory of Composing Non-linear Machines with Predictable Cyclic Structures
- Study of five-neighborhood linear hybrid cellular automata and their synthesis
- Generating cryptographically suitable non-linear maximum length cellular automata
- Propagation characteristics of the divergence of elementary cellular automata
- Parallel Processing and Applied Mathematics
- Designing conflict free cellular automata-based PRNG
- Nonuniform cellular automata for cryptography
- Achieving better security using nonlinear cellular automata as a cryptographic primitive
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)
