Skip to main content

Niederreiter Encryption Scheme

  • Reference work entry
Encyclopedia of Cryptography and Security

Related Concepts

Error Correcting Codes; McEliece Public Key Cryptosystem; Public-Key Encryption; Syndrome Decoding Problem

Definition

The Niederreiter PKC is a public-key encryption scheme based on error correcting codes. The cryptogram is a syndrome of an error pattern relatively to a parity check matrix of some linear code. Only the legal user, who knows the hidden algebraic structure of this code, can recover the error pattern, the cleartext, from the syndrome.

Theory

The system was introduced by Harald Niederreiter in 1986 [1]. Its security is, as for the McEliece public-key cryptosystem, related to difficult algorithmic problems of algebraic coding theory. It has the same advantages (efficient encryption and decryption) and drawbacks (public-key size, information rate) as the McEliece system. The block size, however, is smaller.

General idea

The cryptogram is a linear combination of t columns of a parity check matrix \(H\in {F}^{r\times n}_{q}\) of some linear code C of length n...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 799.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 949.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Niederreiter H (1986) Knapsack-type cryptosystems and algebraic coding theory. Probl Contr Inf Theory 15(2):157–166

    MathSciNet  Google Scholar 

  2. Sidel’nikov VM, Shestakov SO (1992) On cryptosystem based on generalized Reed-Solomon codes. Discret Math (in russian) 4(3):57–63

    MathSciNet  Google Scholar 

  3. Sendrier N (1998) On the concatenated structure of a linear code. Appl Algebra Eng Commun Comput 9(3):221–242

    MATH  MathSciNet  Google Scholar 

  4. Li YX, Deng RH, Wang XM (1994) On the equivalence of McEliece’s and Niederreiter’s public-key cryptosystems. IEEE Trans Inf Theory 40(1):271–273

    MATH  MathSciNet  Google Scholar 

  5. Sendrier N (2005) Encoding information into constant weight words. In: IEEE conference, ISIT 2005, Adelaide, pp 435–438

    Google Scholar 

  6. Finiasz M, Sendrier N (2009) Security bounds for the design of code-based cryptosystems. In: Matsui M (ed) Advances in cryptology – ASIACRYPT 2009. Lecture notes in computer science, vol 5912. Springer, Berlin, pp 88–105

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this entry

Cite this entry

Sendrier, N. (2011). Niederreiter Encryption Scheme. In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_385

Download citation

Publish with us

Policies and ethics