Abstract

In this paper, we propose a version of the identification rank metric code-based schemes. This protocol is an improvement of rankbased Véron protocol.It provide 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.

References

• Aragon, N: Cryptographie à base de codes correcteurs d’erreurs en métriquerang et application. Theses, Université de Limoges (Dec 2020), https://tel.archives-ouvertes.fr/tel-03115370.
• Aragon, N., Blazy, O., Gaborit, P., Hauteville, A., Z´emor, G.: Durandal: a rank metric based signature scheme. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. pp. 728–758. Springer (2019.
• Baldi, M., Battaglioni, M., Chiaraluce, F., Horlemann-Trautmann, A.L., Persichetti, E., Santini, P., Weger, V.: A new path to code-based signatures via identification schemes with restricted errors. arXiv preprint arXiv:2008.06403 (2020).
• Bellini, E., Caullery, F., Hasikos, A., Manzano, M., Mateu, V.: Code-based signature schemes from identification protocols in the rank metric. In: International Conference on Cryptology and Network Security. pp. 277–298. Springer (2018).
• Bellini, E., Gaborit, P., Hasikos, A., Mateu, V.: Enhancing code basedzeroknowledgeproofsusingrankmetric. IACRCryptol. ePrintArch. 2020, 1472(2020), https://eprint.iacr.org/2020/1472.
• Cayrel, P.L., Alaoui, S.: Dual construction of stern-based signature scheme 63,98–103 (03 2010).
• Cayrel, P.L., Véron, P., El YousfiAlaoui, S.M.: A zero-knowledge identification scheme based on the q-ary syndrome decoding problem. In: International Workshop on Selected Areas in Cryptography. pp. 171–186. Springer (2010).
• Gabidulin, E.M.: Rank-metric codes and applications. MoscowInst. Phys.Technol., StateUniv., Dolgoprudny, Russia.[Online].Available:http://iitp.ru/upload/content/839/Gabidulin. pdf
• Gabidulin, E.M.: Theory of codes with maximum rank distance. ProblemyPeredachiInformatsii 21(1), 3–16 (1985)
• Gaborit, P., Ruatta, O., Schrek, J.: On the complexity of the rank syndrome decoding problem. IEEE Transactions on Information Theory 62(2), 1006–1019 (2015)
• Loidreau, P.: Etude et optimisation de cryptosystèmes à clé publique fondés sur lathéorie des codes correcteurs. Ph.D. thesis (5 2001)
• Melchor, C.A., Gaborit, P., Schrek, J.: A new zero-knowledge code based identification scheme with reduced communication. 2011 IEEE Information Theory Workshop pp. 648–652 (2011)
• Moufek, H.: Les codes correcteurs pour la cryptographie. Ph.D. thesis, Faculté d eMathématiques (2017)
• Overbeck, R., Sendrier, N.: Code-based cryptography. In: Post-quantum cryptography, pp. 95–145. Springer (2009)
• Richmond, T.: 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).
• Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th annual symposium on foundations of computer science.pp. 124–134. Ieee (1994)