Encyclopedia of Mathematics and Its Applications: The Theory of Information and Coding: A Mathematical Framework for Communication
The Rao-Nam Scheme is Insecure Against a Chosen-Plaintext Attack
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Decoding random binary linear codes in 2n/20: how 1 + 1 = 0 improves information set decoding
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Hi-index | 0.00 |
This paper suggests a way in which an interesting Public Key Cryptosystem based on Goppa Codes introduced by R. J. McEliece can be modified and used in a classical way to yield several advantages. The primary benefit is that the rate of the code (or data expansion reciporocal) can be increased by approximately 75%. Secondly (for public key and classical versions), by using a polynomial with no linear or repeated factors instead of an irreducible one to generate the Goppa Code, the code parameters remain the same and the decoding apparatus can be used to test candidate generators. Lastly, a wider range of transformations is made possible. No degradation in security is incurred.