Niederreiter cryptosystem

The Niederreiter cryptosystem is a cryptographic system developed by Niederreiter in 1986. It is based on a parity-check matrix for a code, unlike the McEliece-based system which uses a generator matrix. The Niederreiter cryptosystem includes a preprocessing step that converts enciphered messages into syndromes. This system overcomes the drawback of the McEliece cryptosystem and is a variant of it, with a reduced key size.From: Mathematics in Cyber Research [2022], Hardware Efficient Crypto-Coder Systems for Wireless Channels [2019]

Cryptography

View Chapter

Purchase Book

Published in Paul L. Goethals, Natalie M. Scala, Daniel T. Bennett, Mathematics in Cyber Research, 2022

Gretchen L. Matthews, Aidan W. Murphy

The Niederreiter cryptosystem (Niederreiter, 1986) is based on a parity-check matrix for a code rather than a generator matrix (as in a McEliece-based system) and includes a preprocessing step so that enciphered messages are syndromes. It has some advantages in terms of key size and speed. We abstract the key components below for use with an arbitrary linear code, calling such a system Niederreiter-based; the original Niederreiter cryptosystem is based on Reed-Solomon codes. Before doing so, it is worth pointing out a key difference in Niederreiter and McEliece.

Hardware Efficient Crypto-Coder Systems for Wireless Channels

View Article

Journal Information

Published in IETE Journal of Research, 2019

Jeena Jose, David Solomon George

The McEliece cryptosystem [1] is one of the oldest public-key cryptosystem ever designed. It is also the first public-key cryptosystem based on linear error-correcting codes. It needs a very large public key which makes it very difficult to use in many practical situations. The drawback of McEliece cryptosystem is overcome by Niederreiter cryptosystem [2,3], which is a variant of McEliece cryptosystem whereby the key size is reduced. It is based on finite field arithmetic constructed by Bose and Chowla. A joint encryption and error correction coding was proposed by Kak [4] which is based on D-sequences. Gligoroski et al. in [5] combined encryption and error correction into a single step.

Niederreiter cryptosystem

Explore chapters and articles related to this topic

Cryptography

Hardware Efficient Crypto-Coder Systems for Wireless Channels