Abstract
In this paper we look at the Gabidulin version of the McEliece cryptosystem (GPT). In order to avoid Gibson’s attacks on GPT, several variants have been proposed. We cryptanalyze the variant with column scrambler and the one using reducible rank codes. Employing Gibson’s attacks as a black box, we get an efficient attack for the parameter sets proposed for GPT with column scrambler. As a countermeasure to our attack, we propose a new variant of the GPT cryptosystem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Berger, T.P., Loidreau, P.: Security of the Niederreiter form of the GPT public-key cryptosystem. In: IEEE International Symposium on Information Theory, Lausanne, Suisse, July 2002. IEEE, Los Alamitos (2002)
Gabidulin, E.M., Ourivski, A.V.: Column scrambler for the GPT cryptosystem. Discrete Applied Mathematics 128(1), 207–221 (2003)
Gabidulin, E.M.: Theory of codes with maximum rank distance. Problems of Information Transmission 21(1) (1985)
Gabidulin, E.M.: On public-key cryptosystems based on linear codes. In: Proc. of 4th IMA Conference on Cryptography and Coding 1993, Codes and Ciphers. IMA Press (1995)
Gabidulin, E.M., Ourivski, A.V., Honary, B., Ammar, B.: Reducible rank codes and their applications to cryptography. IEEE Transactions on Information Theory 49(12), 3289–3293 (2003)
Gabidulin, E.M., Paramonov, A.V., Tretjakov, O.V.: Ideals over a non-commutative ring and their application in cryptology. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 482–489. Springer, Heidelberg (1991)
Gibson, J.K.: Severely denting the Gabidulin version of the McEliece public key cryptosystem. J-Designs-Codes-Cryptogr 6(1), 37–45 (1995)
Gibson, J.K.: The security of the gabidulin public key cryptosystem. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 212–223. Springer, Heidelberg (1996)
Johansson, T., Ourivski, A.V.: New technique for decoding codes in the rank metric and its cryptography applications. Problems of Information Transmission 38(3), 237–246 (2002)
Overbeck, R.: A new structural attack for GPT and variants. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol. 3715, pp. 50–63. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Overbeck, R. (2006). Extending Gibson’s Attacks on the GPT Cryptosystem. In: Ytrehus, Ø. (eds) Coding and Cryptography. WCC 2005. Lecture Notes in Computer Science, vol 3969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779360_15
Download citation
DOI: https://doi.org/10.1007/11779360_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35481-9
Online ISBN: 978-3-540-35482-6
eBook Packages: Computer ScienceComputer Science (R0)