Questions tagged [niederreiter]

The Niederreiter cryptosystem is a variation of the McEliece Cryptosystem and is equivalent to McEliece from a security point of view, but encryption using Niederreiter is about ten times faster than encryption with McEliece.

Filter by
Sorted by
Tagged with
0 votes
1 answer
29 views

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

Is there a better way than brute forcing (choose $k=\mathrm{rank}(A)$ first columns - test the determinant, if determinant = 0 choose new column set - there are $\binom nk$ many possibilities which is ...
fepaul's user avatar
  • 35
3 votes
2 answers
75 views

Decrypting McEliece if security assumptions fail

1. G known - how to decrypt Referring to this question: Basic attacks on McEliece; finding S and P (nobody answered) Take a McEliece cryptosystem with public generator matrix $G′=SGP$ where $G$ is a ...
fepaul's user avatar
  • 35
1 vote
1 answer
228 views

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

Seemingly, Niederreiter cryptosystem is faster than McEliece, and it can also be used to implement digital signature. Why isn't this scheme appear in NIST post quantum competition?
Evgeni Vaknin's user avatar
1 vote
1 answer
146 views

Proof that Niederreiter Cryptosystem is correct

I read about Niederreiter Cryptosystem. I understood the Key Generator, encryption and decryption of the cryptosystem, but if I want to prove that is a correct cryptosystem, what should I do?
CodingGuy's user avatar
  • 111
2 votes
0 answers
121 views

A proposal for randomization of Niederreiter cryptosystem

The Niederreiter cryptosystem is a public key cryptosystem using Goppa code. Unfortunately it it is insecure unless it is a binary code. So I thought I could insert random linear codes into randomly ...
cryptomania's user avatar
1 vote
0 answers
104 views

Is there a public-key system that can chain?

Does there exist any asymmetric cryptosystem that has the following properties: If I know somebody's public key PBK_1 and my own key pair (PVK_2,PBK_2), I can construct a new public key PBK_3 such ...
Tehom - Tom Breton's user avatar
7 votes
1 answer
330 views

Why doesn't “Classic McEliece” need scrambling?

The original McEliece scheme uses two random matrices S and P to scramble the generator matrix and uses $\mathsf S·\mathsf G·\mathsf P$ as the public key. The Niederreiter variant also does about the ...
Marian's user avatar
  • 201
2 votes
2 answers
362 views

Niederreiter cryptosystem

I can't understand how Niederreiter cryptosystem works. If $c=mH^{'T}$ than why we cannot compute $m$ directly by multiplying $c$ with the $(H^{'T})^{-1}$? Can you give me an example of a "fast ...
mip's user avatar
  • 327
1 vote
0 answers
125 views

Does the McBits cryptosystem work without permutation matrix?

I'm studying post quantum cryptography and recently found McBits (PDF) that is a version of the Niederreiter cryptosystem. I think I understand most of how the system works, but got a bit confused ...
Maurax's user avatar
  • 26
1 vote
1 answer
132 views

McEliece variants that support signatures

Besides the Niederreiter cryptosystem, are there any other variants that support digital signatures? Can any of them sign arbitrary signatures unlike the Niederreiter cryptosystem? What are the key ...
Melab's user avatar
  • 3,605
0 votes
0 answers
118 views

Question Error Correcting Codes

Let $C$ be a code over the finite field $GF(2)$ with generator matrix $G$ and parity matrix $H$. Let $e+C=C'$ be a coset of code $C$. Let $S$ be a non-singular matrix and $H'=H\times S$. Finally, let $...
juaninf's user avatar
  • 2,641