Cryptology ePrint Archive: Report 2019/1272

The Niederreiter cryptosystem and Quasi-Cyclic codes

Upendra Kapshikar and Ayan Mahalanobis

Abstract: 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.

Category / Keywords: public-key cryptography / Niederrieter cryptosystem, hidden subgroup problem

Date: received 2 Nov 2019

Contact author: ayan mahalanobis at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20191105:082151 (All versions of this report)

Short URL: ia.cr/2019/1272