# Tag Info

Accepted

### Decrypting McEliece if security assumptions fail

If you know $G$ and $G'$ you can recover typically recover $P$ from the support splitting algorithm. Note that the support-splitting algorithm is independent of the bases used to represent the two ...
• 22.8k

### McEliece variants that support signatures

There is a variant of the Neiderreiter system by Courtois, Finiasz, and Sendrier found in their paper: "How to achieve a McEliece-based Digital Signature Scheme" from Asiacrypt 2001. The Wikipedia ...
Accepted

### How to choose rank(A) independant columns of matrix A efficiently

Compute the row echelon form of the matrix and select the pivot columns. Computing the row echelon form of a $m\times n$ matrix will take $O(m^2n)$ field operation, which is pretty straightforward. If ...
• 22.8k
1 vote

### why Niederreiter cryptosystem is not a candidate in NIST PQC competition?

Classic McEliece is using the Niederreiter T-OWF: The KEM is built conservatively from a PKE designed for OW-CPA security, namely Niederreiter’s dual version of McEliece’s PKE using binary ...
• 706
1 vote

### Proof that Niederreiter Cryptosystem is correct

To prove the correctness of an encryption scheme (not necessarily Niederreiter), you have to prove that for a honestly generated key pair, any honestly generated ciphertext decrypts correctly. ...
• 111
1 vote

### Why doesn't “Classic McEliece” need scrambling?

It seems to me that the answer is highly likely to be as follows. I only had a quick look, so buyer beware: So, instead of the recovered permuted error vector $\sigma(e)$ ( $e$ is the plaintext, in ...
• 22k
1 vote

### Niederreiter cryptosystem

In the Niederreiter system, the plaintext is mapped to some error vector of weight $t$, where the code correction capability is $d=2t+1.$ With the trapdoor information (permutation) this can be ...
• 22k

Only top scored, non community-wiki answers of a minimum length are eligible