Cryptography Stack Exchange
Cryptography Stack Exchange

Questions tagged [mceliece]

McEliece cryptosystem is an asymmetric encryption algorithm and 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.

McEliece cryptosystem is an asymmetric encryption algorithm and 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.

McEliece consists of three algorithms:

  1. a probabilistic key generation algorithm which produces a public and a private key,
  2. a probabilistic encryption algorithm, and
  3. a deterministic decryption algorithm.
49 questions
12
votes
1 answer

Efficient decoding of irreducible binary Goppa codes and the role of matrix P in McEliece cryptosystem

If we assume that the support for an irreducible binary Goppa code $\gamma_1, ..., \gamma_n$ is publicly known, when is it possible to efficiently decode the code? I know it's possible if one knows the generator polynomial $g(x)$, and also, if one…
Zuzana
  • 121
  • 2
3
votes
0 answers

How to choose McEliece's parameters?

At the time of this writing, there are 3 sources for parameters for the McEliece public-key cryptosystem out there. The first paper is the original McEliece paper ("A Public-Key Cryptosystem based on Algebraic Coding Theory" by McEliece), which only…
SEJPM
  • 45,967
  • 7
  • 99
  • 205
2
votes
1 answer

How can the Stern's algorithm be used to attack McEliece?

I'm reading about the attacks of the McEliece cryptosystem. I needed to work out a lot of things because most descriptions I have found so far on the internet seems to be quite hand-wavy about the details. So I wrote down what I understand or I…
Calmarius
  • 280
  • 2
  • 7
2
votes
1 answer

Why has the McEliece cryptosystem not gained much acceptance, but now is a candidate for post-quantum cryptography?

I understand that the McEliece cryptosystem is an asymmetric encryption algorithm developed in 1978 by Robert McEliece, almost around the same time RSA came about. Why has the McEliece cryptosystem never gained much acceptance in the cryptographic…
Nathan Aw
  • 2,277
  • 3
  • 17
  • 21
1
vote
1 answer

key size of public key in McEliece

The length of public-key matrix in McEliece cryptosystem is $n \times k$. Then the key size is $\frac{n \times k}{8}$ bytes. But I find that the key size is $\frac{(n-k) \times k}{8}$ bytes. why ?
Nour28
  • 23
  • 3
0
votes
1 answer

Optimization of the McEliece crypto system

In the normal McEliece proposal, the public key G' = SGP is used, with S beeing non-singular, G Generator Matrix and P permutation Matrix In the White Paper on McEliece with Binary Goppa Codes by Michiel Marcus and the lecture of Tanja Lange it says…
fepaul
  • 35
  • 3