McEliece cryptosystem

Common card · No. 472507

In cryptography, the McEliece cryptosystem is an asymmetric encryption algorithm developed in 1978 by Robert McEliece. It was the first such scheme to use randomization in the encryption process. The algorithm has never gained much acceptance in the cryptographic community, but is a candidate for "post-quantum cryptography", as it is immune to attacks using Shor's algorithm and – more generally – measuring coset states using Fourier sampling. The algorithm is based on the hardness of decoding a general linear code (which is known to be NP-hard) and of the hardness of using the public key to recover an efficient decoding algorithm . For a description of the private key, an error-correcting code is selected for which an efficient decoding algorithm is known, and that is able to correct t {\displaystyle t} errors. The original algorithm uses binary Goppa codes (subfield codes of algebraic geometry codes of a genus-0 curve over finite fields of characteristic...

Read on Wikipedia