Skip to main content
Top
Published in: Designs, Codes and Cryptography 9/2020

17-07-2020

On the security of a Loidreau rank metric code based encryption scheme

Authors: Daniel Coggia, Alain Couvreur

Published in: Designs, Codes and Cryptography | Issue 9/2020

Login to get access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

We present a polynomial time attack of a rank metric code based encryption scheme due to Loidreau for some parameters.
Appendix
Available only for authorised users
Footnotes
1
Processor: Intel® Core™ i5-8250U CPU @ 1.60GHz.
 
Literature
2.
go back to reference Berger T.P.: Isometries for rank distance and permutation group of Gabidulin codes. IEEE Trans. Inform. Theory 49(11), 3016–3019 (2003).MathSciNetCrossRef Berger T.P.: Isometries for rank distance and permutation group of Gabidulin codes. IEEE Trans. Inform. Theory 49(11), 3016–3019 (2003).MathSciNetCrossRef
3.
go back to reference Bosma W., Cannon J., Playoust C.: The Magma algebra system I: the user language. J. Symb. Comput. 24(3/4), 235–265 (1997).MathSciNetCrossRef Bosma W., Cannon J., Playoust C.: The Magma algebra system I: the user language. J. Symb. Comput. 24(3/4), 235–265 (1997).MathSciNetCrossRef
4.
go back to reference Bostan, A., Chyzak, F., Giusti, M., Lebreton, R., Lecerf, G., Salvy, B., Schost, E.: Algorithmes Efficaces en Calcul Formel. Frédéric Chyzak (auto-édit.), Palaiseau (Sep 2017), https://hal.archives-ouvertes.fr/AECF/, 686 p. Imprimé par CreateSpace. Aussi disponible en version électronique Bostan, A., Chyzak, F., Giusti, M., Lebreton, R., Lecerf, G., Salvy, B., Schost, E.: Algorithmes Efficaces en Calcul Formel. Frédéric Chyzak (auto-édit.), Palaiseau (Sep 2017), https://​hal.​archives-ouvertes.​fr/​AECF/​, 686 p. Imprimé par CreateSpace. Aussi disponible en version électronique
5.
go back to reference Couvreur A., Gaborit P., Gauthier-Umaña V., Otmani A., Tillich J.P.: Distinguisher-based attacks on public-key cryptosystems using Reed–Solomon codes. Des. Codes Cryptogr. 73(2), 641–666 (2014).MathSciNetCrossRef Couvreur A., Gaborit P., Gauthier-Umaña V., Otmani A., Tillich J.P.: Distinguisher-based attacks on public-key cryptosystems using Reed–Solomon codes. Des. Codes Cryptogr. 73(2), 641–666 (2014).MathSciNetCrossRef
6.
go back to reference Couvreur, A., Otmani, A., Tillich, J.P., Gauthier-Umaña, V.: A polynomial-time attack on the BBCRS scheme. In: Katz, J. (ed.) Public-Key Cryptography - PKC 2015. LNCS, vol. 9020, pp. 175–193. Springer (2015) Couvreur, A., Otmani, A., Tillich, J.P., Gauthier-Umaña, V.: A polynomial-time attack on the BBCRS scheme. In: Katz, J. (ed.) Public-Key Cryptography - PKC 2015. LNCS, vol. 9020, pp. 175–193. Springer (2015)
7.
go back to reference Delsarte P.: Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory Ser. A 25(3), 226–241 (1978).MathSciNetCrossRef Delsarte P.: Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory Ser. A 25(3), 226–241 (1978).MathSciNetCrossRef
8.
go back to reference Faugère, J.C., Gauthier, V., Otmani, A., Perret, L., Tillich, J.P.: A distinguisher for high rate McEliece cryptosystems. IACR Cryptology ePrint Archive, Report 2010/331 (2010), http://eprint.iacr.org/ Faugère, J.C., Gauthier, V., Otmani, A., Perret, L., Tillich, J.P.: A distinguisher for high rate McEliece cryptosystems. IACR Cryptology ePrint Archive, Report 2010/331 (2010), http://​eprint.​iacr.​org/​
9.
go back to reference Gabidulin E.M.: Theory of codes with maximum rank distance. Prob. Peredachi Inf. 21(1), 3–16 (1985).MathSciNetMATH Gabidulin E.M.: Theory of codes with maximum rank distance. Prob. Peredachi Inf. 21(1), 3–16 (1985).MathSciNetMATH
10.
go back to reference Gabidulin, E.M., Paramonov, A.V., Tretjakov, O.V.: Ideals over a non-commutative ring and their applications to cryptography. In: Advances in Cryptology - EUROCRYPT’91. pp. 482–489. No. 547 in LNCS, Brighton (1991) Gabidulin, E.M., Paramonov, A.V., Tretjakov, O.V.: Ideals over a non-commutative ring and their applications to cryptography. In: Advances in Cryptology - EUROCRYPT’91. pp. 482–489. No. 547 in LNCS, Brighton (1991)
12.
go back to reference Loidreau P.: A Welch–Berlekamp like algorithm for decoding Gabidulin codes. In: Ytrehus Ø. (ed.) Coding and Cryptography, pp. 36–45. Springer, Berlin (2006).CrossRef Loidreau P.: A Welch–Berlekamp like algorithm for decoding Gabidulin codes. In: Ytrehus Ø. (ed.) Coding and Cryptography, pp. 36–45. Springer, Berlin (2006).CrossRef
13.
go back to reference Loidreau, P.: A new rank metric codes based encryption scheme. In: Post-Quantum Cryptography 2017. LNCS, vol. 10346, pp. 3–17. Springer (2017) Loidreau, P.: A new rank metric codes based encryption scheme. In: Post-Quantum Cryptography 2017. LNCS, vol. 10346, pp. 3–17. Springer (2017)
14.
go back to reference McEliece, R.J.: A Public-Key System Based on Algebraic Coding Theory, pp. 114–116. Jet Propulsion Lab (1978), dSN Progress Report 44 McEliece, R.J.: A Public-Key System Based on Algebraic Coding Theory, pp. 114–116. Jet Propulsion Lab (1978), dSN Progress Report 44
15.
go back to reference Overbeck R.: Structural attacks for public key cryptosystems based on Gabidulin codes. J. Cryptol. 21(2), 280–301 (2008).MathSciNetCrossRef Overbeck R.: Structural attacks for public key cryptosystems based on Gabidulin codes. J. Cryptol. 21(2), 280–301 (2008).MathSciNetCrossRef
Metadata
Title
On the security of a Loidreau rank metric code based encryption scheme
Authors
Daniel Coggia
Alain Couvreur
Publication date
17-07-2020
Publisher
Springer US
Published in
Designs, Codes and Cryptography / Issue 9/2020
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-020-00781-4

Other articles of this Issue 9/2020

Designs, Codes and Cryptography 9/2020 Go to the issue

Premium Partner