Abstract
A joint signature, entyption and error correction public-key cryptosystem is presented based on an NP-completeness problem—the decoding problem of general linear codes in algebraic coding theory.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. J. McEliece, A public-key cryptosystem based on algeraic coding theory, DSN Progress Report, Jet Propulsion Laboratory, Pasadena, CA, Jan./Feb. (1978), pp. 114–116.
H. Niederreiter,Problems of Control and Information Theory,15(1986)2, 159–166.
Wang Xinmei,Acta Electronica Sinica(in Chinese),14(1986)4, 84–90.
Wang Xinmei,Journal of China Institute of Communications(in Chinese),7(1986)5, 1–6.
Li Yuanxing,Nature Journal(in Chinese), 1990, No. 8, pp. 538.
T. Hwang, T. R. N. Rao, Abstracts of Papers, (1990), IEEE Int. Symp. on Information Theory, San Diego, Jan. 14–19, (1990), p. 143.
E. R. Berleknmp et al.,IEEE Trans. on IT,IT-24(1978)3, 384–386.
B. Chor, Two Issues in Public-Key Cryptography—RSA Bit Security and a New Knapsack Type System, MIT, London, (1986).
F. J. MacWilliams et al., The Theory of Error-Correcting Codes Part I, North-Holland, Oxford, (1977).
A. V. Aho et al., The Design and Analysis of Computer Algorithms, Addison-Wesley, London, (1974).
Author information
Authors and Affiliations
Additional information
Subject supported by the National Natural Science Fund of China
About this article
Cite this article
Yuanxing, L., Jian, C. & Xinmei, W. A joint signature encryption and error correction public-key cryptosystem based on algebraic coding theory. J. of Electron.(China) 9, 33–39 (1992). https://doi.org/10.1007/BF02778590
Issue Date:
DOI: https://doi.org/10.1007/BF02778590