Author:
Kapshikar Upendra,Mahalanobis Ayan
Abstract
<p style='text-indent:20px;'>McEliece and Niederreiter cryptosystems are robust and versatile cryptosystems. These cryptosystems work with many linear error-correcting codes. They are popular these days because they can be quantum-secure. In this paper, we study the Niederreiter cryptosystem using non-binary 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 weak quantum Fourier sampling. Though our work uses the weak Fourier sampling, we argue that its conclusions should remain valid for the strong Fourier sampling as well.</p>
Publisher
American Institute of Mathematical Sciences (AIMS)
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics,Computer Networks and Communications,Algebra and Number Theory,Applied Mathematics,Discrete Mathematics and Combinatorics,Computer Networks and Communications,Algebra and Number Theory
Reference32 articles.
1. J. L. Alperin and R. B. Bell, Groups and Representations, Springer, 1995.
2. D. Apon, R. Perlner, A. Robinson and P. Santini, Cryptanalysis of LEDAcrypt, Annual International Cryptology Conference, Springer, 12172 (2020), 389–418.
3. N. Aragon, P. Barreto, S. Bettaieb, L. Bidoux, O. Blazy, J.-C. Deneuville, P. Gaborit, S. Gueron, T. Guneysu, C. A. Melchor, et al., BIKE: Bit flipping key encapsulation.
4. M. Baldi, QC-LDPC Code-Based Cryptography, Springer, 2014.
5. M. Baldi, M. Bianchi, F. Chiaralunce, J. Rosenthal, D. Schipani.Enhanced public key security for the McEliece cryptosystem, J. Cryptology, 29 (2016), 1-27.