Characterization of Linear Structures
Designs, Codes and Cryptography
The Software-Oriented Stream Cipher SSC2
FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
Design and Properties of a New Pseudorandom Generator Based on a Filtered FCSR Automaton
IEEE Transactions on Computers
Fast low order approximation of cryptographic functions
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
When stream cipher analysis meets public-key cryptography
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
On a resynchronization weakness in a class of combiners with memory
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Revisiting correlation-immunity in filter generators
SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
Pseudorandom sequences and stream ciphers
Algorithms and theory of computation handbook
Equivalence classes of Boolean functions for first-order correlation
IEEE Transactions on Information Theory
Cryptography and Communications
An automatic, time-based, secure pairing protocol for passive RFID
RFIDSec'11 Proceedings of the 7th international conference on RFID Security and Privacy
Linear Complexity of Generalized Cyclotomic Binary Sequences of Order 2
Finite Fields and Their Applications
Algebraic attacks on a class of stream ciphers with unknown output function
Designs, Codes and Cryptography
| Hi-index | 0.06 |
A running key generator consisting of a maximum-length (ML) linear feedback shift register (LFSR) and some nonlinear feedforward state filter function is investigated. It is shown how a cryptanalyst can find an equivalent system in a ciphertext-only attack. The analysis uses a Walsh orthogonal expansion of the state filter function and its relation to the crosscorrelation function (CCF) between the ML-sequence and the produced running key sequence.