Synthesis of maximum length cellular automata with nonlinearity injections
From MaRDI portal
Publication:6137465
Recommendations
- Achieving better security using nonlinear cellular automata as a cryptographic primitive
- Cryptographically suitable maximum length cellular automata
- scientific article; zbMATH DE number 7385042
- Generating cryptographically suitable non-linear maximum length cellular automata
- On the security of designing a cellular automata based stream cipher
Cites work
- 1-resiliency of bipermutive cellular automata rules
- A Walsh exploration of elementary CA rules
- Achieving better security using nonlinear cellular automata as a cryptographic primitive
- Advances on random sequence generation by uniform cellular automata
- Cryptographic Boolean functions and applications.
- scientific article; zbMATH DE number 1070886 (Why is no real title available?)
- Preventing fault attacks using fault randomisation with a case study on AES
- Random sequence generation by cellular automata
Cited in
(2)
This page was built for publication: Synthesis of maximum length cellular automata with nonlinearity injections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6137465)