Achieving Better Security Using Nonlinear Cellular Automata as a Cryptographic Primitive
From MaRDI portal
Publication:5114848
DOI10.1007/978-981-13-0023-3_1zbMath1455.68112OpenAlexW2856370221MaRDI QIDQ5114848
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
Related Items (2)
Uses Software
Cites Work
- Random sequence generation by cellular automata
- On the security of designing a cellular automata based stream cipher
- 1-Resiliency of Bipermutive Cellular Automata Rules
- Advances on Random Sequence Generation by Uniform Cellular Automata
- Analysis of Pseudo Random Sequences Generated by Cellular Automata
- Analysis of one-dimensional linear hybrid cellular automata over GF(q)
- Unnamed Item
- Unnamed Item
This page was built for publication: Achieving Better Security Using Nonlinear Cellular Automata as a Cryptographic Primitive