Abstract
The linear syndrome (LS) method is elaborated for the purpose of solving problems encountered in cryptanalysis, which can be reduced to the following mathematical setting. Suppose the cryptanalyst has at his hand a sufficiently long segment of the binary sequence B = A + X, where A is a linear sequence with known feedback polynomial f(x) and X is a sequence with unknown or very complicated algebraic structure, but is sparse in the sense that, if we denote its signals by x(i), i > o, then we shall have s = prob( x(i) = 1) = 1/2 − ε, o < ∈ < 1/2. we call s the error rate of the sequence A in the sequence 8, and the job of the cryptanalyst is to recover the former from the captured segment of the latter.
Chapter PDF
Similar content being viewed by others
References
Zeng Kencheng, “Phenomena of Key-entropy Leak in Cryptosystems”, unpublished report presented to “Symposium on Problems of Cryptanalysis” Beijing, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zeng, K., Hung, M. (1990). On the Linear Syndrome Method in Cryptanalysis. In: Goldwasser, S. (eds) Advances in Cryptology — CRYPTO’ 88. CRYPTO 1988. Lecture Notes in Computer Science, vol 403. Springer, New York, NY. https://doi.org/10.1007/0-387-34799-2_32
Download citation
DOI: https://doi.org/10.1007/0-387-34799-2_32
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97196-4
Online ISBN: 978-0-387-34799-8
eBook Packages: Springer Book Archive