Skip to main content
SpringerLink
Log in

Discrete optimisation and fast correlation attacks

  • Conference paper
  • First Online:
Cryptography: Policy and Algorithms (CPA 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1029))

Included in the following conference series:

Abstract

Modifications to fast correlation attacks on stream ciphers are investigated. Improvements are achieved with both deterministic and random choices for updates of the corresponding posterior probabilities and with fast and partial resetting methods. The use of simulated annealing and appropriate optimisation heuristics is also proposed and successful experimental results are obtained. It is shown that a search for error-free information sets is a necessary technique to be applied after the iterative error-correction algorithms to deal with high noise probabilities.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. Chepyzhov and B. Smeets, “On a fast correlation attack on stream ciphers,” Advances in Cryptology-EUROCRYPT '91, Lecture Notes in Computer Science, vol. 547, D. W. Davies ed., Springer-Verlag, pp. 176–185, 1991.

    Google Scholar 

  2. A. J. Clark, “Modern optimisation algorithms for cryptanalysis,” in Proceedings of ANZIIS '94, pp. 258–262, 1994.

    Google Scholar 

  3. W. S. Forsyth and R. Safavi-Naini, “Automated cryptanalysis of substitution ciphers,” Cryptologia, vol. 17, no. 4, pp. 407–418, Oct. 1993.

    Google Scholar 

  4. R. G. Gallager, “Low-density parity-check codes,” IRE Trans. Inform. Theory, vol. IT-8, pp. 21–28, Jan. 1962.

    Google Scholar 

  5. J. Dj. Golić, “Correlation via linear sequential circuit approximation of combiners with memory,” Advances in Cryptology EUROCRYPT'92, Lecture Notes in Computer Science, vol. 658, R. A. Rueppel ed., Springer-Verlag, pp. 113–123, 1993.

    Google Scholar 

  6. J. Dj. Golić, “On the security of shift register based keystream generators,” Fast Software Encryption-Cambridge '93, Lecture Notes in Computer Science, vol. 809, R. J. Anderson ed., pp. 91–101, 1994.

    Google Scholar 

  7. S. Kirkpatrick, C. D. Gelatt, Jr. and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, 1983.

    Google Scholar 

  8. J. L. Massey, Threshold Decoding. Cambridge, MA, MIT Press, 1963.

    Google Scholar 

  9. W. Meier and O. Staffelbach, “Fast correlation attacks on certain stream ciphers,” Journal of Cryptology, vol. 1, pp. 159–176, 1989.

    Google Scholar 

  10. M. J. Mihaljević and J. Dj. Golić, “A fast iterative algorithm for a shift register initial state reconstruction given the noisy output sequence,” Advances in Cryptology-AUSCRYPT '90, Lecture Notes in Computer Science, vol. 453, J. Seberry and J. Pieprzyk eds., Springer-Verlag, pp. 165–175, 1990.

    Google Scholar 

  11. M. J. Mihaljević and J. Dj. Golić, “A comparison of cryptanalytic principles based on iterative error-correction,” Advances in Cryptology-EUROCRYPT '91, Lecture Notes in Computer Science, vol. 547, D. W. Davies ed., Springer-Verlag, pp. 527–531, 1991.

    Google Scholar 

  12. M. J. Mihaljević and J. Dj. Golić, “Convergence of a Bayesian iterative error-correction procedure on a noisy shift register sequence,” Advances in Cryptology — EUROCRYPT'92, Lecture Notes in Computer Science, vol. 658, R. A. Rueppel ed., Springer-Verlag, pp. 124–137, 1993.

    Google Scholar 

  13. R. A. Rueppel, “Stream Ciphers,” in Contemporary Cryptology: The Science of Information Integrity, G. Simmons ed., pp. 65–134, New York, IEEE Press, 1991.

    Google Scholar 

  14. T. Siegenthaler, “Decrypting a class of stream ciphers using ciphertext only,” IEEE Trans. Comput., vol. C-34, pp. 81–85, Jan. 1985.

    Google Scholar 

  15. K. Zeng and M. Huang, “On the linear syndrome method in cryptanalysis,” Advances in Cryptology-CRYPTO '88, Lecture Notes in Computer Science, vol. 403, S. Goldwasser ed., Springer-Verlag, pp. 469–478, 1990.

    Google Scholar 

  16. M. Živković, “On two probabilistic decoding algorithms for binary linear codes,” IEEE Trans. Inform. Theory, vol. IT-37, pp. 1707–1716, Nov. 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Security Research Centre, Queensland University of Technology, GPO Box 2434, 4001, Brisbane, Qld, Australia

    Jovan Dj. Golić, Mahmoud Salmasizadeh, Andrew Clark, Abdollah Khodkar & Ed Dawson

Authors
  1. Jovan Dj. Golić
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mahmoud Salmasizadeh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andrew Clark
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Abdollah Khodkar
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Ed Dawson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ed Dawson Jovan Golić

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Golić, J.D., Salmasizadeh, M., Clark, A., Khodkar, A., Dawson, E. (1996). Discrete optimisation and fast correlation attacks. In: Dawson, E., Golić, J. (eds) Cryptography: Policy and Algorithms. CPA 1995. Lecture Notes in Computer Science, vol 1029. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032358

Download citation

  • DOI: https://doi.org/10.1007/BFb0032358

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60759-5

  • Online ISBN: 978-3-540-49363-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation