Advertisement

QC-LDPC Code-Based Cryptosystems

  • Marco BaldiEmail author
Chapter
Part of the SpringerBriefs in Electrical and Computer Engineering book series (BRIEFSELECTRIC)

Abstract

In this chapter, the use of QC-LDPC codes in public key cryptosystems inspired to the McEliece and Niederreiter systems is studied. Both the case in which the private and the public code are permutation equivalent and that in which such an equivalence is absent are considered. It is shown that the use of this kind of codes may expose the system to new attacks, which can be very dangerous if the system is not suitably designed. The countermeasures to be used against these attacks are described, and some practical instances of QC-LDPC code-based public key cryptosystems achieving some specific security levels are provided. The chance to use QC-LDPC codes also in digital signature schemes and symmetric cryptosystems is briefly discussed.

Keywords

QC-LDPC code-based cryptosystems Permutation-equivalent codes Cryptanalysis Information set decoding Key size Complexity 

References

  1. 1.
    Monico C, Rosenthal J, Shokrollahi A (2000) Using low density parity check codes in the McEliece cryptosystem. In: Proceedings of ISIT 2000, Sorrento, Italy, p 215Google Scholar
  2. 2.
    Baldi M, Chiaraluce F, Garello R (2006), On the usage of quasi-cyclic low-density parity-check codes in the McEliece cryptosystem. In: Proceedings of first international conference on communications and electronics (ICCE’06), Hanoi, Vietnam, pp 305–310Google Scholar
  3. 3.
    Baldi M, Chiaraluce F (2007) Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC codes. In: Proceedings of IEEE international symposium on information theory (ISIT 2007), Nice, France, pp 2591–2595Google Scholar
  4. 4.
    Baldi M, Chiaraluce F, Garello R, Mininni F (2007) Quasi-cyclic low-density parity-check codes in the McEliece cryptosystem. In: Proceedings of IEEE international conference on communications (ICC’07), Glasgow, Scotland, pp 951–956Google Scholar
  5. 5.
    Otmani A, Tillich JP, Dallot L (2008) Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes. In: Proceedings of first international conference on symbolic computation and cryptography (SCC 2008), Beijing, ChinaGoogle Scholar
  6. 6.
    Baldi M, Bodrato M, Chiaraluce F (2008) A new analysis of the McEliece cryptosystem based on QC-LDPC codes. In: Security and cryptography for networks. Lecture notes in computer science, vol 5229, Springer, Berlin, pp 246–262Google Scholar
  7. 7.
    Baldi M (2009) LDPC codes in the McEliece cryptosystem: attacks and countermeasures, NATO science for peace and security series-D: information and communication security, vol 23, IOS Press, pp 160–174Google Scholar
  8. 8.
    Misoczki R, Tillich JP, Sendrier N, Barreto P (2013) MDPC-McEliece: new McEliece variants from moderate density parity-check codes. In: Proceedings of IEEE international symposium on information theory (ISIT 2013), Istanbul, Turkey, pp 2069–2073Google Scholar
  9. 9.
    Baldi M, Bianchi M, Chiaraluce F (2013a) Optimization of the parity-check matrix density in QC-LDPC code-based McEliece cryptosystems. In: Proceedings of IEEE ICC (2013) workshop on information security over noisy and lossy communication systems. Budapest, HungaryGoogle Scholar
  10. 10.
    Baldi M, Bianchi M, Chiaraluce F (2013b) Security and complexity of the McEliece cryptosystem based on QC-LDPC codes. IET Inf Secur 7(3):212–220CrossRefGoogle Scholar
  11. 11.
    Baldi M, Bianchi M, Maturo N, Chiaraluce F (2013d) Improving the efficiency of the LDPC code-based McEliece cryptosystem through irregular codes. In: Proceedings of IEEE symposium on computers and communications (ISCC 2013), Split, CroatiaGoogle Scholar
  12. 12.
    Gallager RG (1962) Low-density parity-check codes. IRE Trans Inf Theor IT-8:21–28Google Scholar
  13. 13.
    Luby M, Mitzenmacher M, Shokrollahi M, Spielman D (2001) Improved low-density parity-check codes using irregular graphs. IEEE Trans Inf Theor 47(2):585–598CrossRefzbMATHMathSciNetGoogle Scholar
  14. 14.
    Zarrinkhat P, Banihashemi A (2004) Threshold values and convergence properties of majority-based algorithms for decoding regular low-density parity-check codes. IEEE Trans Commun 52(12):2087–2097CrossRefGoogle Scholar
  15. 15.
    Baldi M (2006) Quasi-cyclic low-density parity-check codes and their application to cryptography. PhD thesis, Università Politecnica delle Marche, Ancona, ItalyGoogle Scholar
  16. 16.
    Fossorier MPC, Kobara K, Imai H (2007) Modeling bit flipping decoding based on nonorthogonal check sums with application to iterative decoding attack of McEliece cryptosystem. IEEE Trans Inf Theor 53:402–411CrossRefMathSciNetGoogle Scholar
  17. 17.
    Peters C (2010) Information-set decoding for linear codes over \(F_q\). In: Post-quantum cryptography. Lecture notes in computer science, vol 6061, Springer, Berlin, pp 81–94Google Scholar
  18. 18.
    Becker A, Joux A, May A, Meurer A (2012) Decoding random binary linear codes in \(2^{n/20}\): How 1 + 1 = 0 improves information set decoding. In: EUROCRYPT 2012, Cambridge, UK. Lecture notes in computer science, vol 7237, Springer, Berlin pp 520–536Google Scholar
  19. 19.
  20. 20.
    Hamdaoui Y, Sendrier N (2013) A non asymptotic analysis of information set decoding. IACR cryptology ePrint archive, http://eprint.iacr.org/2013/162
  21. 21.
    Sendrier N (2011) Decoding one out of many. In: Yang BY (ed) Post-quantum cryptography, vol 7071. Lecture notes in computer science, Springer, Berlin, pp 51–67Google Scholar
  22. 22.
    Bernstein DJ, Lange T, Peters C (2008) Attacking and defending the McEliece cryptosystem. In: Post-quantum cryptography. Lecture notes in computer science, vol 5299, Springer, Berlin, pp 31–46Google Scholar
  23. 23.
    Baldi M, Bianchi M, Chiaraluce F, Rosenthal J, Schipani D (2013c) Using LDGM codes and sparse syndromes to achieve digital signatures. In: Gaborit P (ed) Post-quantum cryptography, vol 7932. Lecture notes in computer science, Springer, Berlin, pp 1–15Google Scholar
  24. 24.
    Sobhi Afshar A, Eghlidos T, Aref M (2009) Efficient secure channel coding based on quasi-cyclic low-density parity-check codes. IET Commun 3(2):279–292CrossRefzbMATHMathSciNetGoogle Scholar
  25. 25.
    Barbero ÁI, Ytrehus Ö (2000) Modifications of the Rao-Nam cryptosystem. In: Buchmann J, Hholdt T, Stichtenoth H, Tapia-Recillas H (eds) Coding theory. Cryptography and related areas, Springer, Berlin, pp 1–12Google Scholar

Copyright information

© The Author(s) 2014

Authors and Affiliations

  1. 1.DIIUniversitá Politecnica delle MarcheAnconaItaly

Personalised recommendations