Methods and applications of error-free computation
Methods and applications of error-free computation
Analysis and design of stream ciphers
Analysis and design of stream ciphers
A simple unpredictable pseudo random number generator
SIAM Journal on Computing
Continued fractions and Berlekamp-Massey algorithms
AUSCRYPT '90 Proceedings of the international conference on cryptology on Advances in cryptology
Shift Register Sequences
Fast Software Encryption, Cambridge Security Workshop
Modes of Operation of Stream Ciphers
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
A New Class of Stream Ciphers Combining LFSR and FCSR Architectures
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Design and Properties of a New Pseudorandom Generator Based on a Filtered FCSR Automaton
IEEE Transactions on Computers
New Stream Cipher Designs
Linearity properties of binary FCSR sequences
Designs, Codes and Cryptography
Expected values for the rational complexity of finite binary sequences
Designs, Codes and Cryptography
On the existence of secure feedback registers
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
On a resynchronization weakness in a class of combiners with memory
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
2-adic complexity of binary m-sequences
IEEE Transactions on Information Theory
F-FCSR: design of a new class of stream ciphers
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
The ANF of the composition of addition and multiplication mod 2n
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
On the 2-adic complexity and the k-error 2-adic complexity of periodic binary sequences
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Computing the k-error N-adic complexity of a sequence of period pn
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
On the expected value of the joint 2-adic complexity of periodic binary multisequences
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Cryptanalysis of the F-FCSR stream cipher family
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
Periods of termwise exclusive ors of maximal length FCSR sequences
Finite Fields and Their Applications
| Hi-index | 0.06 |
This paper presents a new algorithm for cryptanalytically attacking stream ciphers. There is an associated measure of security, the 2-adic span. In order for a stream cipher to be secure, its 2-adic span must be large. This attack exposes a weakness of Rueppel and Massey's summation combiner. The algorithm, based on De Weger and Mahler's rational approximation theory for 2-adic numbers, synthesizes a shortest feedback with carry shift register that outputs a particular key stream, given a small number of bits of the key stream. It is adaptive in that it does not neeed to know the number of available bits beforehand.