Implementation of McEliece Encryption Scheme Based on Quasi- Cyclics Goppa Codes (QC-GOPPA)

Authors

  • Abdou Karim Farota Laboratoire des Sciences de l’Atmosphère et de l’Océan - Matériaux, Energie et Dispositifs (LSAO-MED), Université Gaston Berger de Saint-Louis, Sénégal
  • Yacoub Mahamat Adoum 1Laboratoire des Sciences de l’Atmosphère et de l’Océan - Matériaux, Energie et Dispositifs (LSAO-MED), Université Gaston Berger de Saint-Louis, Sénégal
  • Bouya Diop Laboratoire des Sciences de l’Atmosphère et de l’Océan - Matériaux, Energie et Dispositifs (LSAO-MED), Université Gaston Berger de Saint-Louis, Sénégal

DOI:

https://doi.org/10.14738/tecs.115.15567

Keywords:

Linear codes, quasi-cyclic codes, Goppa codes, McEliece cryptosystem

Abstract

The McEliece cryptosystem is one of the oldest public key cryptosystems. It is also the first public key cryptosystem based on error correcting codes. Its main advantages are its speed of encryption and decryption, and high security (promised to resist the quantum computer). But it suffers from a major drawback. Indeed, it requires a very large size of the public key, which makes it very difficult to use in practice. The use of codes having compact generator matrices can significantly reduce the size of the public key. However, with such matrices, security must be strengthened by making a good choice of parameters of the code, if not an opponent will use this change to attack the system. In article we will propose an implementation of the schema of encryption, introducing at the same time the decryption for a bettrer explanation of the global system. Here, we use the quasicyclic version of Goppa codes instead of the classical Goppa codes of the original system for encryption. For the McEliece system is considered safe, we need a security of at least 2 bits. What we propose here is an implementation that offers 85 90 us a 6502bits public key size for a security in the [ 2 bits, 2 bits] interval. We simulate our scheme with Xilinx ISE 14.7. The VHDL is the langage used to describe the scheme.

References

Biswas and Sendrier. “McEliece Cryptosystem Implementation: Theory and Practice”, PQCrypto2008. Proceedings of the 2nd International Workshop on Post-Quantum Cryptography. Pages 47-62, Cincinnati, OH — October 17 - 19, 2008

Thierry Berger, Pierre Louis Cayrel, “Reducing key lengh of the McEliece cryptosystem”, Chapter Progress in Cryptology – AFRICACRYPT 2009. Volume 5580 of the series Lecture Notes in Computer Science pp 77-

Stefan Heyse, “Code-based cryptography: Implementing the McEliece Scheme on Reconfigurable Hardware”, (May 2009), Diploma Thesis Ruhr-University Bochum

Marco Baldi, Marco Bianchi and Franco Chiaraluce, “Security and complexity of the McEliece cryptosystem based on QC-LDPC codes”, Dipartimento di Ingegneria dell’Informazione, Università Politecnica delle Marche. Ancona, Italy.

Valentijn, Ashley, "Goppa Codes and Their Use in the McEliece Cryptosystems" (2015). Syracuse University Honors Program CapstoneProjects. Paper 845

https://github.com/pmassolino/hw-goppa-mceliece. Hardware implementation of the cryptosystem McEliece in VHDL for binary (QD-) Goppa codes. (Consulté pour la dernière fois le 06 Avril 2016).

Bart Preneel, Antoon Bosselaers, René Govaerts1 and Joos Vandewalle, “A Software implementation of the McEliece public-key cryptosystem”, Proceedings of the 13th Symposium on information Theory in the Benelux, Werkgemeenschap voor Informatieen Communicatietheorie, pp. 119{126, 1992.

Pierre Louis Cayrel, Christophe Chabot, Abdelkhader Nacer, “Quasi-cyclic codes as codes over rings of matrices”, In Finite Fields and Their Applications Vol. 16, 2010, pp 100-115

Downloads

Published

2023-10-01

How to Cite

Farota, A. K., Adoum, Y. M., & Diop, B. (2023). Implementation of McEliece Encryption Scheme Based on Quasi- Cyclics Goppa Codes (QC-GOPPA). Transactions on Engineering and Computing Sciences, 11(5), 59–68. https://doi.org/10.14738/tecs.115.15567