On functions of linear shift register sequences
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
On the linear complexity of combined shift register sequences
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
Analysis of a nonlinear feedforward logic for binary sequence generators
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
Galois Switching Functions and Their Applications
IEEE Transactions on Computers
Linear filtering of nonlinear shift-register sequences
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
| Hi-index | 0.00 |
A key stream generator is analyzed which consists of a single linear feedback shift register (LFSR) with a primitive connection polynomial and a nonlinear feedforward logic. It is shown, how, for arbitrary integers n and r and a binary LFSR of length L = n ċ r the linear complexity of the generated keystream can be determined for a large class of nonlinear feedforward logics. Moreover, a simple condition imposed on these logics ensures an ideal r-tupel distribution for these keystreams. Practically useful solutions exist where the keystream has linear complexity n ċ rn-1 together with an ideal r-tupel distribution.