[Resource Topic] 2019/1272: The Niederreiter cryptosystem and Quasi-Cyclic codes

Welcome to the resource topic for 2019/1272

The Niederreiter cryptosystem and Quasi-Cyclic codes

Authors: Upendra Kapshikar, Ayan Mahalanobis


McEliece and Niederreiter cryptosystems are robust and versatile cryptosystems. These cryptosystems work with any linear error-correcting codes. They are popular these days because they can be quantum-secure. In this paper, we study the Niederreiter cryptosystem using quasi-cyclic codes. We prove, if these quasi-cyclic codes satisfy certain conditions, the corresponding Niederreiter cryptosystem is resistant to the hidden subgroup problem using quantum Fourier sampling. Our proof requires the classification of finite simple groups.

ePrint: https://eprint.iacr.org/2019/1272

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .