Subject: [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR] | [ INFO.INFO-IT ] Computer Science [cs]/Information Theory [cs.IT] | Computer Science - Information Theory | [ INFO.INFO-CR ] Computer Science [cs]/Cryptography and Security [cs.CR]
arxiv: Computer Science::Cryptography and Security
International audience; The main practical limitation of the McEliece public-key encryption scheme is probably the size of its key. A famous trend to overcome this issue is to focus on subclasses of alternant/Goppa codes with a non trivial automorphism group. Such codes... View more
 P. S. L. M. Barreto, R. Lindner, and R. Misoczki, “Monoidic codes in cryptography,” in PQCrypto, ser. Lecture Notes in Computer Science, B.-Y. Yang, Ed., vol. 7071. Springer, 2011, pp. 179-199.
 R. Misoczki, J.-P. Tillich, N. Sendrier, and P. S. L. M. Barreto, “MDPC-McEliece: New McEliece variants from moderate density parity-check codes,” in ISIT, 2013, pp. 2069-2073.
 P. Gaborit, “Shorter keys for code based cryptography,” in Proceedings of the 2005 International Workshop on Coding and Cryptography (WCC 2005), Bergen, Norway, Mar. 2005, pp. 81-91.
 T. P. Berger, P. Cayrel, P. Gaborit, and A. Otmani, “Reducing key length of the McEliece cryptosystem,” in Progress in Cryptology - Second International Conference on Cryptology in Africa (AFRICACRYPT 2009), ser. Lecture Notes in Computer Science, B. Preneel, Ed., vol. 5580, Gammarth, Tunisia, Jun. 21-25 2009, pp. 77-97.
 R. Misoczki and P. S. L. M. Barreto, “Compact McEliece keys from Goppa codes,” in Selected Areas in Cryptography (SAC 2009), Calgary, Canada, Aug. 13-14 2009.
 E. Persichetti, “Compact McEliece keys based on quasi-dyadic Srivastava codes,” J. Mathematical Cryptology, vol. 6, no. 2, pp. 149-169, 2012.
 A. Otmani, J. Tillich, and L. Dallot, “Cryptanalysis of McEliece cryptosystem based on quasi-cyclic LDPC codes,” in Proceedings of First International Conference on Symbolic Computation and Cryptography. Beijing, China: LMIB Beihang University, Apr. 28-30 2008, pp. 69-81.
 --, “Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes,” Mathematics in Computer Science, vol. 3, no. 2, pp. 129-140, 2010.
 J.-C. Fauge`re, A. Otmani, L. Perret, and J.-P. Tillich, “Algebraic cryptanalysis of McEliece variants with compact keys,” in EUROCRYPT, 2010, pp. 279-298.
 --, “Algebraic Cryptanalysis of McEliece variants with compact keys - toward a complexity analysis,” in SCC '10: Proceedings of the 2nd International Conference on Symbolic Computation and Cryptography, RHUL, June 2010, pp. 45-55. [Online]. Available: http://www-polsys.lip6.fr/∼jcf/Papers/SCC2010a.pdf