Advances and Applications in Discrete Mathematics

The Advances and Applications in Discrete Mathematics is a prestigious peer-reviewed journal indexed in the Emerging Sources Citation Index (ESCI). It is dedicated to publishing original research articles in the field of discrete mathematics and combinatorics, including topics such as graphs, coding theory, and block design. The journal emphasizes efficient and powerful tools for real-world applications and welcomes expository articles that highlight current developments in the field.

Submit Article

SCHEME SIGNATURE BASED ON DC-LRPC CODES

Authors

  • Regis F. Babindamana
  • Peter A. Kidoudou
  • Franck W. Boubayi

DOI:

https://doi.org/10.17654/0974165826005

Abstract

In this paper, we present a version of the signature based on DC-LRPC code. This protocol is an improvement of the rank-based Véron protocol. It provides smaller public and private key sizes. With the same complexity as the Véron scheme, we make the scheme more secure by hiding the structure of the code used.

Received: September 10, 2025
Accepted: November 12, 2025

References

[1] N. Aragon, Cryptographie à base de codes correcteurs d’erreurs en métriquerang et application, Theses, Université de Limoges, 2020.

https://tel.archives-ouvertes.fr/tel-03115370.

[2] N. Aragon, O. Blazy, P. Gaborit, A. Hauteville and G. Zemor, Durandal: a rank metric based signature scheme, Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer, 2019, 728-758.

[3] M. Baldi, M. Battaglioni, F. Chiaraluce, A. L. Horlemann-Trautmann, E. Persichetti, P. Santini and V. Weger, A new path to code-based signatures via identification schemes with restricted errors, 2020.

arXiv preprint arXiv:2008.06403.

[4] E. Bellini, F. Caullery, A. Hasikos, M. Manzano and V. Mateu, Code-based signature schemes from identification protocols in the rank metric, International Conference on Cryptology and Network Security, Springer, 2018, 277-298.

[5] E. Bellini, P. Gaborit, A. Hasikos and V. Mateu, Enhancing code based zero-knowledge proofs using rank metric, IACR Cryptol. ePrint Arch. 2020, 1472 (2020). https://eprint.iacr.org/2020/1472.

[6] P. L. Cayrel and S. Alaoui, Dual construction of stern-based signature scheme, World Academy of Science, Engineering and Technology 4(3) (2010).

[7] P. L. Cayrel, P. Véron and S. M. El Y. Alaoui, A Zero-knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem, International Workshop on Selected Areas in Cryptography, Springer, 2010, pp. 171-186.

[8] N. T. Courtois, M. Finiasz and N. Sendrier, How to achieve a McEliece-based digital signature scheme, International Conference on the Theory and Application of Cryptology and Information Security, Springer, 2001, pp. 157-174.

[9] A. Fiat and A. Shamir, How to Prove Yourself: Practical Solutions to Identification and Signature Problems, Conference on the Theory and Application of Cryptographic Techniques, Springer, 1986, pp. 186-194.

[10] E. M. Gabidulin, A. Paramonov and O. Tretjakov, Ideals Over a Non-commutative Ring and Their Application in Cryptology, Workshop on the Theory and Application of Cryptographic Techniques, Springer, 1991, pp. 482-489.

[11] E. M. Gabidulin, Rank-metric codes and applications, Moscow Inst. Phys. Technol., State Univ., Dolgoprudny, Russia.

[Online]. Available: http://iitp.ru/upload/content/839/Gabidulin.Pdf.

[12] E. M. Gabidulin, Theory of codes with maximum rank distance, Problemy Peredachi Informatsii 21(1) (1985), 3-16.

[13] P. Gaborit, G. Murat and O. Ruatta, Olivier and Zémor, Gilles: Low rank parity check codes and their application to cryptography, WCC (2013), 167-179.

[14] P. Gaborit, O. Ruatta and J. Schrek, On the complexity of the rank syndrome decoding problem, IEEE Transactions on Information Theory 62(2) (2015), 1006-1019.

[15] P. Loidreau, A new rank metric codes based encryption scheme, Post-Quantum Cryptography 2017, LNCS, Vol. 10346, Springer, 2017, pp. 3-17.

[16] P. Loidreau, Etude et optimisation de cryptosystèmes à clé publique fondés sur la théorie des codes correcteurs, Ph.D. dissertation, Ecole Polytechnique, Paris, France, 2001.

[17] C. A. Melchor, P. Gaborit and J. Schrek, A new zero-knowledge code based identification scheme with reduced communication, 2011 IEEE Information Theory Workshop (2011), 648-652.

[18] H. Moufek, Les codes correcteurs pour la cryptographie, Ph.D. Thesis, Faculté de Mathématiques, 2017.

[19] R. Overbeck and N. Sendrier, Code-based Cryptography, Post-quantum cryptography, Springer, 2009, pp. 95-145.

[20] T. Richmond, Implantation sécurisée de protocoles cryptographiques basés sur les codes correcteurs d’erreurs, (secure implementation of cryptographic protocols based on error-correcting codes) 2016.

[20] P. W. Shor, Algorithms for quantum computation: discrete logarithms and factoring, Proceedings 35th Annual Symposium on Foundations of Computer Science, IEEE, 1994, 124-134.

Downloads

Published

2025-12-25

Issue

Vol. 43 No. 1 (2026)

Section

Articles

License

Copyright (c) 2025 PUSHPA PUBLISHING HOUSE, PRAYAGRAJ, INDIA

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

_________________________

Licensing Terms:

Attribution: Credit Pushpa Publishing House as the original publisher, including title and author(s) if applicable.

Contact Pushpa Publishing House for more info or permissions.

How to Cite

SCHEME SIGNATURE BASED ON DC-LRPC CODES. (2025). Advances and Applications in Discrete Mathematics, 43(1), 59-76. https://doi.org/10.17654/0974165826005