Achieving better security using nonlinear cellular automata as a cryptographic primitive
From MaRDI portal
Publication:5114848
DOI10.1007/978-981-13-0023-3_1zbMATH Open1455.68112OpenAlexW2856370221MaRDI QIDQ5114848FDOQ5114848
Dipanwita Roy Chowdhury, Swapan Maiti
Publication date: 29 June 2020
Published in: Communications in Computer and Information Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-981-13-0023-3_1
Recommendations
- On the security of designing a cellular automata based stream cipher
- scientific article; zbMATH DE number 7385042
- \(d\)-monomial tests of nonlinear cellular automata for cryptographic design
- Non-linear and non-group cellular automata chaining technique for cryptographic applications
- Nonuniform cellular automata for cryptography
Cites Work
- Title not available (Why is that?)
- Analysis of Pseudo Random Sequences Generated by Cellular Automata
- Analysis of one-dimensional linear hybrid cellular automata over GF(q)
- Random sequence generation by cellular automata
- Advances on Random Sequence Generation by Uniform Cellular Automata
- On the security of designing a cellular automata based stream cipher
- A Walsh exploration of elementary CA rules
- 1-Resiliency of Bipermutive Cellular Automata Rules
Cited In (6)
- Non-linear and non-group cellular automata chaining technique for cryptographic applications
- Distributed Multi-authority Attribute-Based Encryption Using Cellular Automata
- \(d\)-monomial tests of nonlinear cellular automata for cryptographic design
- Title not available (Why is that?)
- Generating cryptographically suitable non-linear maximum length cellular automata
- Title not available (Why is that?)
Uses Software
This page was built for publication: Achieving better security using nonlinear cellular automata as a cryptographic primitive
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114848)
