You are looking at a specific version 20191105:082151 of this paper.
See the latest version.
Paper 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.
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- Niederrieter cryptosystemhidden subgroup problem
- Contact author(s)
- ayan mahalanobis @ gmail com
- History
- 2019-11-05: received
- Short URL
- https://ia.cr/2019/1272
- License
-
CC BY