Abstract
We present an algorithm that achieves general syndrome decoding of a (n, k, r) linear rank distance code over GF(q m) in O(nr + m) 3 q (m−r)(r−1)) elementary operations. As a consequence, the cryptographical schemes [Che94, Che96] which rely on this problem are not secure with the proposed parameters. We also derive from our algorithm a bound on the minimal rank distance of a linear code which shows that the parameters from [Che94] are inconsistent.
On leave from Délégation Générale de l'Armement
Unité de Recherche Associée n∘ 1327 du Centre National de la Recherche Scientifique
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E.R. Berlekamp, R.J. McEliece, and H.C.A. Van Tilborg. On the inherent intractability of certain coding problems. IEEE Trans. Inform. Theory, IT-24(3):384–386, May 1978.
K. Chen. Improved Girault identification scheme. IEE Electronic Letters, 30(19):1590–1591, sep 1994.
K. Chen. A new identification algorithm. In Cryptography Policy and Algorithms conference, volume 1029, pages 244–249. LNCS, 1996.
F. Chabaud and R. Lercier. Zen: A new toolbox for finite extensions in finite fields. Rapport de recherche, Laboratoire d'Informatique de l'Ecole Polytechnique, 91128 Palaiseau Cedex, France, 1996. in preparation.
J.-B. Fischer and J. Stern. An efficient pseudo-random generator provably as secure as syndrome decoding. In Advances in Cryptology — EUROCRYPT '96, volume to appear. LNCS, 1996.
E.M. Gabidulin. Theory of codes with maximum rank distance. Problems of Information Transmission, 21:1–12, 1985.
M. Girault. A (non practical) three-pass identification protocol using coding theory. In Proc. Auscrypt'90, volume 453, pages 265–272. LNCS, 1990.
S. Harari. A new authentication algorithm. In Coding Theory and Applications, volume 388, pages 204–211. LNCS, 1989.
R. Lidl and H. Niederreiter. Finite fields. In Gian-Carlo Rota, editor, Encyclopedia of Mathematics and its applications. Addison-Wesley Publishing Company, 1983.
F.J. MacWilliams and N.J.A. Sloane. The Theory of Error-correcting Codes. North-Holland, 1983.
J. Stern. A new paradigm for public key identification. IEEE Trans. Inform. Theory. to be published.
J. Stern. An alternative to the Fiat-Shamir protocol. In Advances in Cryptology — EUROCRYPT '89, pages 173–180. LNCS, 1990.
J. Stern. A new identification scheme based on syndrome decoding. In Advances in Cryptology — CRYPTO '93, volume 773. LNCS, 1994.
P. Véron. Cryptanalysis of Harari's identification scheme. In Cryptography and Coding, volume 1025, pages 264–269. LNCS, 1995.
P. Véron. Problème SD, Opérateur Trace, Schémas d'identification et Codes de Goppa. PhD thesis, Université de Toulon et du Var, juillet 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag
About this paper
Cite this paper
Chabaud, F., Stern, J. (1996). The cryptographic security of the syndrome decoding problem for rank distance codes. In: Kim, K., Matsumoto, T. (eds) Advances in Cryptology — ASIACRYPT '96. ASIACRYPT 1996. Lecture Notes in Computer Science, vol 1163. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034862
Download citation
DOI: https://doi.org/10.1007/BFb0034862
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61872-0
Online ISBN: 978-3-540-70707-3
eBook Packages: Springer Book Archive