Chosen ciphertext attack on a new class of self-synchronizing stream ciphers

Authors:
Bin Zhang;Hongjun Wu;Dengguo Feng;Feng Bao
Affiliations:
Institute for Infocomm Research, Singapore;Institute for Infocomm Research, Singapore;State Key Laboratory of Information Security, Graduate School of the Chinese Academy of Sciences, Beijing, P.R. China;Institute for Infocomm Research, Singapore
Venue:
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Year:
2004

Citing 5
Cited 2

The number field sieve

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Handbook of Applied Cryptography

Handbook of Applied 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
Fibonacci and Galois representations of feedback-with-carry shift registers

IEEE Transactions on Information Theory

Chosen-Ciphertext attacks against MOSQUITO

FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
Cryptanalysis of the F-FCSR stream cipher family

SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

At Indocrypt’2002, Arnault et al. proposed a new class of self-synchronizing stream ciphers combining LFSR and FCSR architectures. It was claimed to be resistant to known attacks. In this paper, we show that such a self-synchronizing stream cipher is extremely vulnerable to chosen ciphertext attack. We can restore the secret keys easily from one chosen ciphertext with little computation. For the parameters given in the original design, it takes less than one second to restore the secret keys on a Pentium 4 processor.