Skip to main content
Conference ProceedingsOPEN ACCESS

An improved linear syndrome algorithm in cryptanalysis with applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1991) 537 LNCS 34-47
DOI: 10.1007/3-540-38424-3_3
29Citations
Citations of this article
36Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A new algorithm is developed for making attacks to certain comparatively simple LFSR based cipher systems. 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 bit generators of Geffe (1973) and Beth-Piper (1984).

Cite

CITATION STYLE

APA

Zeng, K., Yang, C. H., & Rao, T. R. N. (1991). An improved linear syndrome algorithm in cryptanalysis with applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 537 LNCS, pp. 34–47). Springer Verlag. https://doi.org/10.1007/3-540-38424-3_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free