Cellular automata as generators of interleaving sequences
From MaRDI portal
Cites work
- Advances in cryptology -- CRYPTO '85. Proceedings. (A Conference on the Theory and Application of Cryptographic techniques held at the University of California, Santa Barbara, August 18--22, 1985)
- Analysis of Pseudo Random Sequences Generated by Cellular Automata
- CAR30: a new scalable stream cipher with rule 30
- Computing shifts in 90/150 cellular automata sequences
- Cryptanalysis of the FLIP family of stream ciphers
- Cryptography with shrinking generators. Fundamentals and applications of keystream sequence generators based on irregular decimation
- Discrete linear models for the generalized self-shrunken sequences
- Handbook of finite fields
- scientific article; zbMATH DE number 1024042 (Why is no real title available?)
- Insights gained after a decade of cellular automata-based cryptography
- Linear models for the self-shrinking generator based on CA
- Linear solutions for cryptographic nonlinear sequence generators
- Modelling the shrinking generator in terms of linear CA
- Random sequence generation by cellular automata
- Recovering decimation-based cryptographic sequences by means of linear CAs
- Some comments on Zech's logarithms
- Trivium: A Stream Cipher Construction Inspired by Block Cipher Design Principles
- Understanding cryptography. From established symmetric and asymmetric ciphers to post-quantum algorithms
This page was built for publication: Cellular automata as generators of interleaving sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7238534)
