Skip to main content
Springer Nature Link
Log in

Critical Noise for Convergence of Iterative Probabilistic Decoding with Belief Propagation in Cryptographic Applications

  • Conference paper
  • First Online:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 1999)

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

Abstract

In this paper, the critical noise beyond which no convergence can be expected is determined for iterative decoding with belief propagation of binary linear block codes over the binary symmetric channel. This value is derived developing the self composition channel model first introduced for iterative a-posteriori-probability decoding. These results are then applied to the cryptanalysis of a keystream generator based on linear feedback shift registers.

This research was supported in part by the National Science Foundation under Grant CCR-97-32959, by the Science Fund of Serbia under Grant 04M02, through the Mathematical Institute, Serbian Academy of Science and Arts and by the Japan Society for Promotion of Science (JSPS) under Contract JSPS-RFTF-96P00604.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. A.M. Chan and F.R. Kschischang, “A simple taboo-based soft-decision decoding algorithm for expander codes,” IEEE Commun. Lett., vol. 2, pp. 183–185, 1998.

    Article  Google Scholar 

  2. V. Chepyzhov and B. Smeets, “On fast correlation attack on certain stream ciphers,” Advances in Cryptology-EUROCRYPT’ 91, Lecture Notes in Computer Science,vol. 547, pp. 176–185, 1991.

    Google Scholar 

  3. G. C. Clark, Jr. and J. B. Cain, Error-Correcting Coding for Digital Communications. New York: Plenum Press, 1982.

    Google Scholar 

  4. A. Clark, J. Dj. Golić, and E. Dawson, “A comparison of fast correlation attacks,” Fast Software Encryption-Cambridge’ 96, Lecture Notes in Computer Science, vol. 1039, pp. 145–157, 1996.

    Google Scholar 

  5. M.P.C. Fossorier, M. Mihaljević and H. Imai, “Reduced complexity iterative decoding of low density parity check codes based on belief propagation,” IEEE Trans. Commun., vol. 47, pp. 673–680, May 1999.

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  7. M.G. Luby, M. Mitzenmacher, M.A. Shokrollahi and D.A. Spielman, “Analysis of Low Density Codes and Improved Designs Using Irregular Graphs,” 30th ACM STOC, May 1998.

    Google Scholar 

  8. R. Lucas, M. Bossert, and M. Breitbach, “On Iterative soft-decision decoding of linear binary block codes and product codes,” IEEE Jour. Select. Areas Commun., vol. 16, pp. 276–298, Feb. 1998.

    Article  Google Scholar 

  9. D.J.C. MacKay, “Good error-correcting codes based on very sparse matrices,” IEEE Trans. Inform. Theory, vol. 45, pp. 399–431, Mar. 1999.

    Article  MATH  MathSciNet  Google Scholar 

  10. D.J.C. MacKay, “Free Energy Minimization Algorithm for Decoding and Cryptanalysis,” Electronics Lett., vol. 31, pp. 446–447, Mar. 1995.

    Google Scholar 

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

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  13. A. Menezes, P.C. van Oorschot and S.A. Vanstone, Handbook of Applied Cryptography. Boca Raton: CRC Press, 1997.

    MATH  Google Scholar 

  14. M. Mihaljević and J. Golić, “A comparison of cryptanalytic principles based on iterative error-correction,” Advances in Cryptology-EUROCRYPT’ 91, Lecture Notes in Computer Science, vol. 547, pp. 527–531, 1991.

    Google Scholar 

  15. M. Mihaljević and J. Golić, “A method for convergence analysis of iterative error-correction decoding,” ISITA 96-1996 IEEE Int. Symp. Inform. Theory and Appl., Canada, Victoria, B.C., Sep. 1996, Proc. pp. 802–805 and submitted to IEEE Trans. Inform. Theory, Apr. 1997.

    Google Scholar 

  16. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Mateo, CA: Morgan Kaufmann, 1988.

    Google Scholar 

  17. T. Richardson and R. Urbanke, “The Capacity of Low-Density Parity Check Codes under Message-Passing Decoding,” submitted to IEEE Trans. Inform. Theory, Nov. 1998.

    Google Scholar 

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

    Article  Google Scholar 

  19. M. Sipser and D.A. Spielman, “Expander codes,” IEEE Trans. Inform. Theory, vol. 42, pp. 1710–1722, Nov. 1996.

    Article  MATH  MathSciNet  Google Scholar 

  20. K. Yamaguchi, H. Iizuka, E. Nomura and H. Imai, “Variable Threshold Soft Decision Decoding,” IEICE Trans. Elect. and Commun., vol. 72, pp. 65–74, Sep. 1989.

    Google Scholar 

  21. K. Zeng, C.H. Yang and T.R.N. Rao, “An improved linear syndrome method in cryptanalysis with applications,” Advances in Cryptology-CRYPTO’ 90, Lecture Notes in Computer Science, vol. 537, pp. 34–47, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, University of Hawaii, 2540 Dole St., Holmes Hall 483, Honolulu, HI96822, USA

    Marc P. C. Fossorier

  2. Mathematical Institute, Serbian Academy of Science and Arts, 11001, Belgrade, Yugoslavia

    Miodrag J. Mihaljević

  3. Institute of Industrial Science, University of Tokyo, 7-22-1 Roppongi, Minato-ku, Tokyo, 106, Japan

    Hideki Imai

Authors
  1. Marc P. C. Fossorier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Miodrag J. Mihaljević
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hideki Imai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering, University of Hawaii, 2540 Dole St., # 483, Honolulu, HI, 96822, USA

    Marc Fossorier  & Shu Lin  & 

  2. Institute of Industrial Science, University of Tokyo, 7-22-1, Roppongi, Minato-ku, Tokyo, 106, Japan

    Hideki Imai

  3. AAECC/IRIT, Université Paul Sabatier, 118, Route de Narbonne, F31067, Toulouse, Cedex, France

    Alain Poli

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fossorier, M.P.C., Mihaljević, M.J., Imai, H. (1999). Critical Noise for Convergence of Iterative Probabilistic Decoding with Belief Propagation in Cryptographic Applications. In: Fossorier, M., Imai, H., Lin, S., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1999. Lecture Notes in Computer Science, vol 1719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46796-3_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-46796-3_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66723-0

  • Online ISBN: 978-3-540-46796-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation