Previous [1] [2] [3] [4] [5] [6] [7] [8]

Journal of Inforamtion Science and Engineering, Vol.16 No.6, pp.799-812 (November 2000)

Enhancing the Security of McEliece
Public-Key Cryptosystem

Hung-Min Sun
Department of Computer Science and Information Engineering
National Cheng Kung University
Tainan, Taiwan 701, R.O.C.
E-mail: hmsun@mail.ncku.edu.tw

Berson pointed out that the McEliece public-key cryptosystem suffers from two weaknesses: (1) failure to protect any message which is encrypted more than once; and (2) failure to protect any messages which have a known linear relationship with one another. In this paper, we propose some variants of the McEliece scheme to prevent Bersons attacks. In addition, we also propose some secure and efficient variants of the McEliece scheme in order to improve the information rate. On the other hand, designing a public-key cryptosystem which is theoretically secure has become more and more important since the introduction of notions of public-key encryption security by Bellare, Desai, Pointcheval, and Rogaway. In this paper, we also propose a variant of the McEliece scheme that is non-malleable under the adaptive chosen ciphertext attack.

Keywords: cryptography, public-key cryptosystem, McEliece scheme, error-correcting codes, goppa codes, information rate

Full Text () Retrieve PDF document (200011_01.pdf)

Received October 17, 1998; revised May 15, 1999; accepted June 23, 1999.
Communicated by Chi Sung Laih