Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling

Kapshikar, Upendra; MAHALANOBIS, AYAN

dc.contributor.author	Kapshikar, Upendra	en_US
dc.contributor.author	MAHALANOBIS, AYAN	en_US
dc.date.accessioned	2021-12-31T07:40:34Z
dc.date.available	2021-12-31T07:40:34Z
dc.date.issued	2021-12	en_US
dc.identifier.citation	Advances in Mathematics of Communications.	en_US
dc.identifier.issn	1930-5346	en_US
dc.identifier.issn	1930-5338	en_US
dc.identifier.uri	https://doi.org/10.3934/amc.2021062	en_US
dc.identifier.uri	http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/6500
dc.description.abstract	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.	en_US
dc.language.iso	en	en_US
dc.publisher	American Institute of Mathematical Sciences	en_US
dc.subject	Niederreiter cryptosystem	en_US
dc.subject	Quasi-cyclic code	en_US
dc.subject	Shidden subgroup prob-lem	en_US
dc.subject	Post-quantum cryptography	en_US
dc.subject	2021-DEC-WEEK4	en_US
dc.subject	TOC-DEC-2021	en_US
dc.subject	2021	en_US
dc.title	Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling	en_US
dc.type	Article	en_US
dc.contributor.department	Dept. of Mathematics	en_US
dc.identifier.sourcetitle	Advances in Mathematics of Communications	en_US
dc.publication.originofpublisher	Foreign	en_US