1-Resiliency of Bipermutive Cellular Automata Rules

DOI10.1007/978-3-642-40867-0_8zbMath1336.68170OpenAlexW90457444MaRDI QIDQ2851304

Alberto Leporati, Luca Mariot

Publication date: 10 October 2013

Published in: Cellular Automata and Discrete Complex Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40867-0_8

zbMATH Keywords

cellular automatanonlinearitystream ciphersBoolean functionsdeterministic chaosWalsh transformpseudorandom number generatorsresiliencypermutivityNIST test suiteENT test suite

Mathematics Subject Classification ID

Cryptography (94A60) Cellular automata (computational aspects) (68Q80)

Related Items (4)

Investigating four neighbourhood cellular automata as better cryptographic primitives ⋮ Cellular Automata Pseudo-Random Number Generators and Their Resistance to Asynchrony ⋮ Achieving Better Security Using Nonlinear Cellular Automata as a Cryptographic Primitive ⋮ Unnamed Item

This page was built for publication: 1-Resiliency of Bipermutive Cellular Automata Rules