论文信息 - The Rao-Nam Scheme is Insecure Against a Chosen-Plaintext Attack

The Rao-Nam Scheme is Insecure Against a Chosen-Plaintext Attack

The Rao-Nam scheme is discussed and generalized to Fq. It is shown that the scheme is insecure against a chosen-plaintext attack for practical code lengths. Based on observations an improved scheme is given, which is not vulnerable to the chosen-plaintext attacks as described.

René Struik | Johan van Tilburg | R. Struik | J. V. Tilburg

[1] Henk Meijer,et al. Security-related comments regarding McEliece's public-key cryptosystem , 1987, IEEE Trans. Inf. Theory.

[2] John P. Jordan,et al. A variant of a public key cryptosystem based on Goppa Codes , 1983, SIGA.

[3] Robert J. McEliece,et al. A public key cryptosystem based on algebraic coding theory , 1978 .

[4] T. R. N. Rao,et al. Private-Key Algebraic-Coded Cryptosystems , 1986, CRYPTO.

[5] Elwyn R. Berlekamp,et al. On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.