Niederreiter cryptosystem

Key takeaways

Niederreiter cryptosystem belongs to computer science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Niederreiter cryptosystem to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Niederreiter cryptosystem from memory before moving on to harder problems.

Reference excerpt

In cryptography, the Niederreiter cryptosystem is a variation of the McEliece cryptosystem developed in 1986 by Harald Niederreiter. It applies the same idea to the parity check matrix, H, of a linear code. Niederreiter is equivalent to McEliece from a security point of view. It uses a syndrome as ciphertext and the message is an error pattern. The encryption of Niederreiter is about ten times faster than the encryption of McEliece. Niederreiter can be used to construct a digital signature scheme.

Scheme definition A special case of Niederreiter's original proposal was broken but the system is secure when used with a Binary Goppa code.

Key generation Alice selects a binary (n, k)-linear Goppa code, G, capable of correcting t errors. This code possesses an efficient decoding algorithm. Alice generates a (n − k) × n parity check matrix, H, for the code, G. Alice selects a random (n − k) × (n − k) binary non-singular matrix, S. Alice selects a random n × n permutation matrix, P. Alice computes the (n − k) × n matrix, Hpub = SHP. Alice's public key is (Hpub, t); her private key is (S, H, P).

Message encryption Suppose Bob wishes to send a message, m, to Alice whose public key is (Hpub, t):

Bob encodes the message, m, as a binary string em' of length n and weight at most t. Bob computes the ciphertext as c = HpubeT.

Message decryption Upon receipt of c = HpubmT from Bob, Alice does the following to retrieve the message, m.

Alice computes S−1c = HPmT. Alice applies a syndrome decoding algorithm for G to recover PmT. Alice computes the message, m, via mT = P−1PmT.

Signature scheme Courtois, Finiasz and Sendrier showed how the Niederreiter cryptosystem can be used to derive a signature scheme .

Calculate s = h ( d ) {\displaystyle s=h(d)} , where h {\displaystyle h} is a Hash Function and d {\displaystyle d} is the signed document. Calculate s i = h ( s | i ) , i = 0 , 1 , 2 , … {\displaystyle s_{i}=h(s|i),i=0,1,2,\dots } , where | {\displaystyle |} denotes concatenation. Attempt to decrypt s i {\displaystyle s_{i}} until the smallest value of i {\displaystyle i} (denoted further as i 0 {\displaystyle i_{0}} ) for which s i {\displaystyle s_{i}} is decryptable is found. Use the trapdoor function to compute such z {\displaystyle z} that H z T = s i 0 {\displaystyle Hz^{T}=s_{i_{0}}} , where H {\displaystyle H} is the public key. Compute the index I z {\displaystyle I_{z}} of z {\displaystyle z} in the space of words of weight 9. Use [ I z | z ] {\displaystyle \left[I_{z}|z\right]} as the signature. The Verification algorithm is much simpler:

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Niederreiter cryptosystem

Start with the simplest possible case. Write down what Niederreiter cryptosystem claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Niederreiter cryptosystem before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Niederreiter cryptosystem ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Niederreiter cryptosystem

In research: Niederreiter cryptosystem appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Niederreiter cryptosystem in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Niederreiter cryptosystem is common in secondary-school and first-year university syllabi. It links to neighbouring topics Code-based cryptography, Digital signature schemes, Post-quantum cryptography, so understanding it makes those chapters shorter.
In everyday life: Look for Niederreiter cryptosystem outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

How to study Niederreiter cryptosystem in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Niederreiter cryptosystem means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Niederreiter cryptosystem out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Niederreiter cryptosystem in simple terms?

In cryptography, the Niederreiter cryptosystem is a variation of the McEliece cryptosystem developed in 1986 by Harald Niederreiter. It applies the same idea to the parity check matrix, H, of a linear code.

Why does Niederreiter cryptosystem matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Niederreiter cryptosystem?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Niederreiter cryptosystem.