In a stream cipher the plaintext digits are encrypted one at a time, and the transformation of successive digits varies during the encryption. LFSRs produce sequences having large periods and good statistical properties, and are readily analyzed using algebraic techniques. But the output sequences of LFSRs are also easily predictable, if we know proper successive output sequences in output sequences. In this paper, we give a new method which generates nonlinear sequences using maximum-length cellular automata.
展开▼
