Abstract
McEliece cryptosystem is a public-key cryptosystem based on error-correcting codes. It constitutes one of the few alternatives to cryptosystems relying on number theory. We present a modification of the McEliece cryptosystem which strengthens its security without increasing the size of the public key. We show that it is possible to use some properties of the automorphism groups of the codes to build decodable patterns of large weight errors. This greatly strengthens the system against the decoding attacks.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Anne Canteaut. Attaques de cryptosystémes á mots de poids faible et construction de fonctions t-résilientes. PhD thesis, Université Paris-VI, 1996.
A. Canteaut and N. Sendrier. Cryptanalysis of the original McEliece cryptosystem. In Kazuo Ohta and Dingyi Pei, eds., Advances in Cryptology-ASIACRYPT’98, number 1514 in LNCS, pages 187–199, 1998.
J. K. Gibson. Equivalent Goppa codes and trapdoors to McEliece’s publickey cryptosystem. In D. W. Davies, ed., Advances in Cryptology-EUROCRYPT’91, number 547 in LNCS, pages 517–521. Springer-Verlag,1991.
J. K. Gibson. Severely Denting the Gabidulin Version of the McEliece Public Key Cryptosystem. Designs, Codes and Cryptography, 6:37–45, 1995.
V. D. Goppa. A new class of linear error-correcting codes. Problemy Peredachi Informatsii, 6(3):207–212, 1970.
E.M. Gabidulin, A. V. Paramonov, and O. V. Tretjakov. Ideals over a non-commutative ring and their application in cryptology. LNCS, 573:482–489, 1991.
Y. X. Li, R. H. Deng, and X. M. Wang. On the equivalence of McEliece’s and Niederreiter’s public-key cryptosystems. IEEE Transactions Information Theory, 40(1):271–273, 1994.
P. Loidreau and N. Sendrier. Some weak keys in McEliece public-key cryptosystem. In IEEE International Symposium on Information Theory, ISIT’98, Boston, page 382, 1998.
R. J. McEliece. A public-key cryptosystem based on algebraic coding theory. Technical report, Jet Propulsion Lab. DSN Progress Report, 1978.
F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes. North Holland, 1977.
H. Niederreiter. Knapsack-type cryptosystems and algebraic coding theory. Problems of Control and Information Theory, 15(2):159–166, 1986.
N. J. Patterson. The algebraic decoding of Goppa codes. IEEE Transactions Information Theory, 21:203–207, 1975.
N. Sendrier. On the concatenated structure of a linear code. AAECC, 9(3):221–242, 1998.
Nicolas Sendrier. The Support Splitting Algorithm. Technical Report 3637, INRIA, March 1999. http://www.inria.fr/RRRT/RR-3637.html.
V. M. Sidel’nikov and S. O. Shestakov. On cryptosystems based on generalized Reed-Solomon codes. Discrete Mathematics, 4(3):57–63, 1992. in russian.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Loidreau, P. (2000). Strengthening McEliece Cryptosystem. In: Okamoto, T. (eds) Advances in Cryptology — ASIACRYPT 2000. ASIACRYPT 2000. Lecture Notes in Computer Science, vol 1976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44448-3_45
Download citation
DOI: https://doi.org/10.1007/3-540-44448-3_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41404-9
Online ISBN: 978-3-540-44448-0
eBook Packages: Springer Book Archive