Abstract
For a noisy clock-controlled shift register statistically optimal probabilistic constrained edit distance a recursive algorithm for its efficient computation are derived. corresponding generalized correlation attack is proposed.
This research was supported by the Science Fund of Se. grant #0403, through Institute of Hathematics. Serbian Acadei. Arts and Sciences.
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
Jovan Dj. Golić, Miodrag J. Mihaljević. “A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance.” J. Cryptology vol. 3, pp. 201–212, 1991.
P.A.V. Hall, G.R. Dowling, “Approximate string matching,” Computing surveys. vol. 12, pp. 381–402, Dec. 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Golić, J.D., Petrović, S.V. (1993). A Generalized Correlation Attack with a Probabilistic Constrained Edit Distance. In: Rueppel, R.A. (eds) Advances in Cryptology — EUROCRYPT’ 92. EUROCRYPT 1992. Lecture Notes in Computer Science, vol 658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47555-9_42
Download citation
DOI: https://doi.org/10.1007/3-540-47555-9_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56413-3
Online ISBN: 978-3-540-47555-2
eBook Packages: Springer Book Archive