Security and complexity of the McEliece cryptosystem based on quasi-cyclic low-density parity-check codes

IET Information Security

Volumn 7, Issue 3, 2013, Pages 212-220

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

^a UNIVERSITÀ POLITECNICA DELLE MARCHE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BIT FLIPPING; LOW-DENSITY PARITY-CHECK (LDPC) CODES; MCELIECE CRYPTOSYSTEM; QUASI CYCLIC LOW DENSITY PARITY CHECK CODES; SMART SOLUTIONS; SPECIAL CLASS; TELECOMMUNICATION STANDARDS; THEORETICAL ARGUMENTS;

QUANTUM COMPUTERS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84883324538     PISSN: 17518709     EISSN: 17518717     Source Type: Journal    
DOI: 10.1049/iet-ifs.2012.0127     Document Type: Article

References (49)

1. McEliece, R.J.: 'A public-key cryptosystem based on algebraic coding theory'. DSN Progress Report, 1978, pp. 114-116
2. Lee, P., Brickell, E.: 'An observation on the security of McEliece's public-key cryptosystem'. Advances in Cryptology - EUROCRYPT 88, 1988, pp. 275-280
3. Stern, J.: 'A method for finding codewords of small weight', in Cohen, G., Wolfmann, J. (Eds.): 'Coding theory and applications', (Springer Verlag, LNCS, 388, 1989), pp. 106-113
4. Canteaut, A., Chabaud, F.: 'A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511', IEEE Trans. Inf. Theory, 1998, 44, (1), pp. 367-378
5. Bernstein, D.J., Lange, T., Peters, C.: 'Attacking and defending the McEliece cryptosystem'. Post-Quantum Cryptography, Springer Verlag, 2008, (LNCS, 5299), pp. 31-46
6. Peters, C.: 'Information-set decoding for linear codes over Fq'. Post-Quantum Cryptography, Springer Verlag, 2010, (LNCS, 6061), pp. 81-94
7. May, A., Meurer, A., Thomae, E.: 'Decoding random linear codes in O (20.054n)'. ASIACRYPT 2011, Springer Verlag, 2011, (LNCS, 7073), pp. 107-124
8. Bernstein, D.J., Lange, T., Peters, C.: 'Smaller decoding exponents: ball-collision decoding'. CRYPTO 2011, Springer Verlag, 2011, (LNCS, 6841), pp. 743-760
9. n/20: how 1 + 1 = 0 improves information set decoding'. EUROCRYPT 2012, Springer Verlag, 2012, (LNCS 7237), pp. 520-536
10. Niederreiter, H.: 'Knapsack-type cryptosystems and algebraic coding theory', Probl. Control Inf. Theory, 1986, 15, pp. 159-166
11. Sidelnikov, V., Shestakov, S.: 'On cryptosystems based on generalized Reed-Solomon codes', Diskretnaya Math., 1992, 4, pp. 57-63
12. Li, Y.X., Deng, R., Wang, X.M.: 'On the equivalence of McEliece's and Niederreiter's public-key cryptosystems', IEEE Trans. Inf. Theory, 1994, 40, (1), pp. 271-273
13. Overbeck, R.: 'Structural attacks for public key cryptosystems based on Gabidulin codes', J. Cryptol., 2008, 21, (2), pp. 280-301
14. Wieschebrink, C.: 'Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes'. Post-quantum cryptography: PQCrypto 2010, Springer Verlag, 2010, (LNCS, 6061), pp. 61-72
15. Berger, T.P., Cayrel, P.-L., Gaborit, P., Otmani, A.: 'Reducing key length of the McEliece cryptosystem'. Progress in Cryptology - AFRICACRYPT 2009, Springer Verlag, 2009, (LNCS, 5580), pp. 77-97
16. Misoczki, R., Barreto, P.S.L.M.: 'Compact McEliece keys from Goppa codes'. Selected Areas in Cryptography, Springer Verlag, 2009, (LNCS, 5867), pp. 376-392
17. Baldi, M.: 'LDPC codes in the McEliece cryptosystem: attacks and countermeasures'. NATO Science for Peace and Security Series - D: Information and Communication Security, 2009, vol. 23, pp. 160-174
18. Sobhi Afshar, A., Eghlidos, T., Aref, M.: 'Efficient secure channel coding based on quasi-cyclic low-density parity-check codes', IET Commun., 2009, 3, (2), pp. 279-292
19. Umana, V.G., Leander, G.: 'Practical key recovery attacks on two McEliece variants'. Proc. Second Int. Conf. on Symbolic Computation and Cryptography, Egham, UK, 2010, pp. 27-44
20. Faugère, J.-C., Otmani, A., Perret, L., Tillich, J.-P.: 'Algebraic cryptanalysis of McEliece variants with compact keys'. EUROCRYPT 2010, Springer Verlag, 2010, (LNCS, 6110), pp. 279-298
21. Barbier, M., Barreto, P.: 'Key reduction of McEliece's cryptosystem using list decoding'. Proc. IEEE Int. Symp. on Information Theory (ISIT 2011), Saint Petersburg, Russia, August 2011, pp. 2681-2685
22. Faugère, J.-C., Otmani, A., Perret, L., Tillich, J.-P.: 'Algebraic cryptanalysis of compact McEliece's variants - toward a complexity analysis'. Proc. Second Int. Conf. on Symbolic Computation and Cryptography, Egham, UK, June 2010, pp. 45-55
23. Gallager, R.G.: 'Low-density parity-check codes', IRE Trans. Inf. Theory, 1962, IT-8, pp. 21-28
24. Tanner, R.M.: 'A recursive approach to low complexity codes', IEEE Trans. Inf. Theory, 1981, 27, (5), pp. 533-547
25. MacKay, D.J.C.: 'Good error correcting codes based on very sparse matrices', IEEE Trans. Inf. Theory, 1999, 45, (2), pp. 399-432
26. Richardson, T., Urbanke, R.: 'The renaissance of Gallager's low-density parity-check codes', IEEE Commun. Mag., 2003, 41, (8), pp. 126-131
27. Richardson, T.J., Urbanke, R.L.: 'The capacity of low-density parity-check codes under message-passing decoding', IEEE Trans. Inf. Theory, 2001, 47, (2), pp. 599-618
28. Tanner, R., Sridhara, D., Fuja, T.: 'A class of group-structured LDPC codes'. Proc. Int. Symp. on Communication Theory and Applications (ISCTA 01), Ambleside, UK, July 2001, pp. 365-370
29. Chen, L., Xu, J., Djurdjevic, I., Lin, S.: 'Near-Shannon-limit quasi-cyclic low-density parity-check codes', IEEE Trans. Commun., 2004, 52, (7), pp. 1038-1042
30. Monico, C., Rosenthal, J., Shokrollahi, A.: 'Using low density parity check codes in the McEliece cryptosystem'. Proc. IEEE Int. Symp. on Information Theory (ISIT 2000), Sorrento, Italy, June 2000, p. 215
31. Baldi, M., Chiaraluce, F., Garello, R., Mininni, F.: 'Quasi-cyclic low-density parity-check codes in the McEliece cryptosystem'. Proc. IEEE Int. Conf. on Communications (ICC 2007), Glasgow, Scotland, June 2007, pp. 951-956
32. Baldi, M., Chiaraluce, F.: 'Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC codes'. Proc. IEEE Int. Symp. on Information Theory (ISIT 2007), Nice, France, June 2007, pp. 2591-2595
33. Otmani, A., Tillich, J.P., Dallot, L.: 'Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes', Mathematics in Computer Science, 2010, 3, (2), pp. 129-140
34. Baldi, M., Bodrato, M., Chiaraluce, F.: 'A new analysis of the McEliece cryptosystem based on QC-LDPC codes'. Security and Cryptography for Networks, Springer Verlag, 2008, (LNCS, 5229), pp. 246-262
35. Gallager, R.G.: 'Low-density parity-check codes' (MIT Press, 1963)
36. Baldi, M., Bambozzi, F., Chiaraluce, F.: 'On a family of circulant matrices for quasi-cyclic low-density generator matrix codes', IEEE Trans. Inf. Theory, 2011, 57, (9), pp. 6052-6067
37. Pearl, J.: 'Reverend Bayes on inference engines: a distributed hierarchical approach'. Proc. Second National Conf. on Artificial Intelligence (AAAI-82), Pittsburgh, PA, August 1982, pp. 133-136
38. Sun, H.M.: 'Improving the security of the McEliece public-key cryptosystem'. ASIACRYPT 1998, Springer Verlag, 1998, (LNCS, 1514), pp. 200-213
39. Engelbert, D., Overbeck, R., Schmidt, A.: 'A summary of McEliece-type cryptosystems and their security', J. Math. Cryptol., 2007, 1, (2), pp. 151-199
40. Winograd, S.: 'Arithmetic Complexity of Computations'. In CBMS-NSF Regional Conf. Series in Mathematics, (Society for Industrial and Applied Mathematics, Philadelphia, 1980, vol. 33)
41. Fan, H., Sun, J., Gu, M., Lam, K.-Y.: 'Overlap-free Karatsuba-Ofman polynomial multiplication algorithms', IET Inf. Sec., 2010, 4, (1), pp. 8-14
42. Hagenauer, J., Offer, E., Papke, L.: 'Iterative decoding of binary block and convolutional codes', IEEE Trans. Inf. Theory, 1996, 42, (2), pp. 429-445
43. Baldi, M., Cancellieri, G., Chiaraluce, F.: 'Finite-precision analysis of demappers and decoders for LDPC-coded M-QAM-systems', IEEE Trans. Broadcast., 2009, 55, (2), pp. 239-250
44. Zarrinkhat, P., Banihashemi, A.: 'Threshold values and convergence properties of majority-based algorithms for decoding regular low-density parity-check codes', IEEE Trans. Commun., 2004, 52, (12), pp. 2087-2097
45. Miladinovic, N., Fossorier, M.P.C.: 'Improved bit-flipping decoding of low-density parity-check codes', IEEE Trans. Inf. Theory, 2005, 51, (4), pp. 1594-1606
46. Cho, J., Sung, W.: 'Adaptive threshold technique for bit-flipping decoding of low-density parity-check codes', IEEE Commun. Lett., 2010, 14, (9), pp. 857-859
47. Faugère, J.-C., Otmani, A., Perret, L., Tillich, J.-P.: 'A distinguisher for high rate McEliece cryptosystems'. Proc. IEEE Information Theory Workshop (ITW), Paraty, Brazil, October 2011, pp. 282-286
48. Baldi, M., Chiaraluce, F., Garello, R.: 'On the usage of quasi-cyclic low-density parity-check codes in the McEliece cryptosystem'. Proc. First Int. Conf. on Communications and Electronics (HUT-ICCE'06), Hanoi, Vietnam, October 2006, pp. 305-310
49. Canteaut, A.: 'Attaques de cryptosystemes a mots de poids faible et construction de fonctions t-resilientes', PhD dissertation, Universite Paris, 6 October 1996