An observation on the security of McEliece's public-key cryptosystem
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Contemporary Cryptology: The Science of Information Integrity
Contemporary Cryptology: The Science of Information Integrity
Cryptography and data security
Cryptography and data security
Public-Key Cryptography State
Algebraic-Geometric Codes
Security-Related Comments Regarding McEliece's Public-Key Cryptosystem
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
On the McEliece Public-Key Cryptosystem
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Algebraic decoding using special divisors
IEEE Transactions on Information Theory
A Fast Decoding Method of AG Codes from Miura-Kamiya Curves Cab up to Half the Feng-Rao Bound
Finite Fields and Their Applications
Cryptography with constant input locality
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
Cryptography in constant parallel time
Cryptography in constant parallel time
Algebraic cryptanalysis of mceliece variants with compact keys
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Information-set decoding for linear codes over Fq
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
Zero-knowledge protocols for the mceliece encryption
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
On the unique representation of very strong algebraic geometry codes
Designs, Codes and Cryptography
On the subfield subcodes of Hermitian codes
Designs, Codes and Cryptography
Computational aspects of retrieving a representation of an algebraic geometry code
Journal of Symbolic Computation
| Hi-index | 0.00 |
McEliece proposed a public-key cryptosystem based on algebraic codes, in particular binary classical Goppa codes. Actually, his scheme needs only a class of codes with a good decoding algorithm and with a huge number of inequivalent members with given parameters. In the present paper we look at various aspects of McEliece's scheme using the new and much larger class of q-ary algebraic-geometric Goppa codes.