Skip to main content

Edit Probability Correlation Attack on the Alternating Step Generator

  • Conference paper

Part of the book series: Discrete Mathematics and Theoretical Computer Science ((DISCMATH))

Abstract

Given an edit transformation defined by the stop/go clocking in the alternating step generator, an edit probability for two binary strings of appropriate lengths is proposed. corresponds alternating An efficient recursive algorithm for the edit probability computation is derived. It is pointed out how this edit probability can be used to mount a statistically optimal correlation attack on each of the clock-controlled shift registers individually. By estimating the underlying false alarm probability, it is shown that the minimum output sequence length required to be known for a successful attack is linear in the length of the respective shift register. This is illustrated by experimental attacks on relatively short shift registers.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Dj. Golie and S. Petrovié, “A generalized correlation attack with a probabilistic constrained edit distance,” Advances in Cryptology - EUROCRYPT ‘82, Lecture Notes in Computer Science, vol. 658, R. A. Rueppel ed., Springer-Verlag, pp. 472–476, 1993.

    Google Scholar 

  2. J. Dj. Golié and L. O’Connor, “Embedding and probabilistic correlation attacks on clock-controlled shift registers,” Advances in Cryptology - EUROCRYPT ‘84, Lecture Notes in Computer Science, vol. 950, A. De Santis ed., Springer-Verlag, pp. 230–243, 1995.

    Google Scholar 

  3. J. Dj. Golié and R. Menicocci, “Edit distance correlation attack on the alternating step generator,” Advances in Cryptology - CRYPTO ‘87, Lecture Notes in Computer Science, vol. 1294, B. Kaliski ed., Springer-Verlag, pp. 499–512, 1997.

    Google Scholar 

  4. D. Gollmann and W. G. Chambers, “Clock-controlled shift registers: A review,” IEEE Journal on Selected Areas in Communications, vol. 7, pp. 525–533, May 1989.

    Article  Google Scholar 

  5. C. G. Günther, “Alternating step generators controlled by de Bruijn sequences,” Advances in Cryptology - EUROCRYPT ‘87, Lecture Notes in Computer Science, vol. 304, D. Chaum and W. L. Price eds., Springer-Verlag, pp. 5–14, 1988.

    Google Scholar 

  6. A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography. New York: CRC Press, 1997.

    MATH  Google Scholar 

  7. K. Zeng, C. H. Yang, and T. R. N. Rao, “On the linear consistency test (LCT) in cryptanalysis with applications,” Advances in Cryptology - CRYPTO ‘89, Lecture Notes in Computer Science, vol. 435, G. Brassard ed., Springer-Verlag, pp. 164–174, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag London

About this paper

Cite this paper

Golić, J.D., Menicocci, R. (1999). Edit Probability Correlation Attack on the Alternating Step Generator. In: Ding, C., Helleseth, T., Niederreiter, H. (eds) Sequences and their Applications. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0551-0_15

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-0551-0_15

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-85233-196-2

  • Online ISBN: 978-1-4471-0551-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics