Optimization of the parity-check matrix density in QC-LDPC code-based McEliece cryptosystems

2013 IEEE International Conference on Communications Workshops, ICC 2013

Volumn , Issue , 2013, Pages 707-711

  Baldi, Marco ^a   Bianchi, Marco ^a   Chiaraluce, Franco ^a  

^a UNIVERSITÀ POLITECNICA DELLE MARCHE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

GOPPA CODES; LOW-DENSITY PARITY-CHECK (LDPC) CODES; MATRIX DENSITY; MCELIECE; MCELIECE CRYPTOSYSTEM; PUBLIC KEYS; QUASICYCLIC LOW-DENSITY PARITY-CHECK (QC-LDPC) CODE; SECURITY LEVEL;

FORWARD ERROR CORRECTION; OPTIMIZATION;

CONVOLUTIONAL CODES;

EID: 84890891494     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCW.2013.6649325     Document Type: Conference Paper

References (23)

1. R. J. McEliece, "A public-key cryptosystem based on algebraic coding theory." DSN Progress Report, pp. 114-116, 1978.
2. H. Niederreiter, "Knapsack-type cryptosystems and algebraic coding theory, " Probl. Contr. and Inform. Theory, vol. 15, pp. 159-166, 1986.
3. D. J. Bernstein, T. Lange, and C. Peters, "Attacking and defending the McEliece cryptosystem, " in Post-Quantum Cryptography, ser. Lecture Notes in Computer Science. Springer Verlag, 2008, vol. 5299, pp. 31-46.
4. R. G. Gallager, "Low-density parity-check codes, " IRE Trans. Inform. Theory, vol. IT-8, pp. 21-28, Jan. 1962.
5. D. J. C. MacKay, "Good error correcting codes based on very sparse matrices, " IEEE Trans. Inform. Theory, vol. 45, no. 2, pp. 399-432, Mar. 1999.
6. E. Paolini and M. Chiani, "Construction of near-optimum burst erasure correcting low-density parity-check codes, " IEEE Trans. Commun., vol. 57, no. 5, pp. 1320-1328, May 2009.
7. M. Baldi, M. Bianchi, and F. Chiaraluce, "Non-systematic codes for physical layer security, " in Proc. IEEE Information Theory Workshop (ITW 2010), Dublin, Ireland, Aug. 2010.
8. M. Baldi, M. Bianchi, and F. Chiaraluce, "Increasing physical layer security through scrambled codes and ARQ, " in Proc. IEEE International Conference on Communications (ICC 2011), Kyoto, Japan, Jun. 2011.
9. M. Baldi, M. Bianchi, and F. Chiaraluce, "Coding with scrambling, concatenation, and HARQ for the AWGN wire-tap channel: A security gap analysis, " IEEE Trans. Inf. Forensics Security, vol. 7, no. 3, pp. 883-894, Jun. 2012.
10. F. Renna, N. Laurenti, S. Tomasin, M. Baldi, N. Maturo, M. Bianchi, F. Chiaraluce, and M. Bloch, "Low-power secret key agreement over OFDM, " in Proc. ACM HotWiSec 2013, Budapest, Hungary, Apr. 2013.
11. C. Monico, J. Rosenthal, and A. Shokrollahi, "Using low density parity check codes in the McEliece cryptosystem, " in Proc. IEEE International Symposium on Information Theory (ISIT 2000), Sorrento, Italy, Jun. 2000, p. 215.
12. M. Baldi, F. Chiaraluce, R. Garello, and F. Mininni, "Quasi-cyclic lowdensity parity-check codes in the McEliece cryptosystem, " in Proc. IEEE International Conference on Communications (ICC 2007), Glasgow, Scotland, Jun. 2007, pp. 951-956.
13. M. Baldi and F. Chiaraluce, "Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC codes, " in Proc. IEEE International Symposium on Information Theory (ISIT 2007), Nice, France, Jun. 2007, pp. 2591-2595.
14. M. Baldi, M. Bodrato, and F. Chiaraluce, "A new analysis of the McEliece cryptosystem based on QC-LDPC codes, " in Security and Cryptography for Networks, ser. Lecture Notes in Computer Science. Springer Verlag, 2008, vol. 5229, pp. 246-262.
15. M. Baldi, M. Bianchi, and F. Chiaraluce. (2012) Security and complexity of the McEliece cryptosystem based on QC-LDPC codes. Accepted for publication in IET Information Security. [Online]. Available: http://arxiv.org/abs/1109.5827.
16. R. Misoczki, J.-P. Tillich, N. Sendrier, and P. S. L. M. Barreto. (2012) MDPC-McEliece: New McEliece variants from moderate density parity-check codes. [Online]. Available: http://eprint.iacr.org/2012/409.
17. F. P. Biasi, P. S. L. M. Barreto, R. Misoczki, and W. V. Ruggiero. (2012) Scaling efficient code-based cryptosystems for embedded platforms.[Online]. Available: http://arxiv.org/abs/1212.4317.
18. M. Baldi, F. Bambozzi, and F. Chiaraluce, "On a family of circulant matrices for quasi-cyclic low-density generator matrix codes, " IEEE Trans. Inform. Theory, vol. 57, no. 9, pp. 6052-6067, Sep. 2011.
19. M. Baldi, M. Bianchi, F. Chiaraluce, J. Rosenthal, and D. Schipani. (2011) Enhanced public key security for the McEliece cryptosystem. Submitted to the Journal of Cryptology. [Online]. Available: http://arxiv.org/abs/1108.2462.
20. C. Peters, "Information-set decoding for linear codes over Fq, " in Post-Quantum Cryptography, ser. Lecture Notes in Computer Science. Springer Verlag, 2010, vol. 6061, pp. 81-94.
21. A. May, A. Meurer, and E. Thomae, "Decoding random linear codes in O(20.054n), " in ASIACRYPT 2011, ser. Lecture Notes in Computer Science. Springer Verlag, 2011, vol. 7073, pp. 107-124.
22. A. Becker, A. Joux, A. May, and A. Meurer, "Decoding random binary linear codes in 2n/20: How 1 + 1 = 0 improves information set decoding, " in EUROCRYPT 2012, ser. Lecture Notes in Computer Science. Springer Verlag, 2012.
23. D. J. Bernstein, T. Lange, and C. Peters, "Smaller decoding exponents: ball-collision decoding, " in CRYPTO 2011, ser. Lecture Notes in Computer Science. Springer Verlag, 2011, vol. 6841, pp. 743-760.