z-logo
open-access-imgOpen Access
Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling
Author(s) -
Upendra Kapshikar,
Ayan Mahalanobis
Publication year - 2023
Publication title -
advances in mathematics of communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.601
H-Index - 26
eISSN - 1930-5346
pISSN - 1930-5338
DOI - 10.3934/amc.2021062
Subject(s) - cryptosystem , mceliece cryptosystem , mathematics , fourier transform , quantum , binary number , discrete mathematics , arithmetic , cryptography , algorithm , quantum mechanics , mathematical analysis , physics
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here