Abstract
A new algorithm is developed for making attacks to certain comparatively simple LFSR based ciphersystems. Special attention is paid towards minimizing the solution distance and guaranteeing the success probability of the attacks. The algorithm is then applied to crack the random generators of Geffe (1973) and Beth-Piper (1984).
This research is supported by Board of Regents of Louisiana Grant #86-USL(2)-127-03
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Kencheng Zeng and Minqiang Huang, On the Linear Syndrome Method in Cyptanalysis, CRYPTO 88, 1988.
Don Coppersmith, Fast Evaluation of Logarithms in Fields of Characteristic Two, IEEE Trans. Information Theory, IT-30, July 1984, pp. 587–594.
Philip R Geffe, How to Protect Data with Ciphers That Are Really Hard to Break, Electronics, Jan. 4, 1973, pp. 99–101.
T. Beth and F.C. Piper, The Stop-and-Go-Generator, EUROCRYPT 84, 1984, pp. 88–92.
K.C. Zcng, C.H. Yang, and T.R.N. Rao, On the Linear Consistency Test in Cryptanalysis, to appear.
J. L. Massey, Shift-Register Synthesis and BCH Decoding, IEEE Trans. Information Theory, IT-15, Jan. 1969, pp. 122–127.
W. Meier and O. Staffelback, Fast Correlation Attacks on Certain Stream Ciphers, Journal of Cryptology, Vol. 1, pp. 159–176, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zeng, K., Yang, C.H., Rao, T.R.N. (1991). An Improved Linear Syndrome Algorithm in Cryptanalysis With Applications. In: Menezes, A.J., Vanstone, S.A. (eds) Advances in Cryptology-CRYPTO’ 90. CRYPTO 1990. Lecture Notes in Computer Science, vol 537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-38424-3_3
Download citation
DOI: https://doi.org/10.1007/3-540-38424-3_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54508-8
Online ISBN: 978-3-540-38424-3
eBook Packages: Springer Book Archive