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

DOI10.3934/AMC.2021062MaRDI QIDQ6047445zbMATH OpenOpenAlexFDO

Authors Upendra Kapshikar, Ayan Mahalanobis

Publication date 12 September 2023

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1911.00661

zbMATH Keywords

hidden subgroup problemNiederreiter cryptosystempost-quantum cryptographyquasi-cyclic codes

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60) Linear codes (general theory) (94B05)

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.

Recommendations

• McEliece and Niederreiter cryptosystems that resist quantum Fourier sampling attacks
• Niederreiter public-key cryptosystem based on QC-LDPC
• Quantum McEliece public-key cryptosystem
• Compact McEliece keys based on quasi-dyadic Srivastava codes
• QC-LDPC code-based cryptography

Cites work

• A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
• Algebraic structure of quasicyclic codes
• Cryptanalysis of LEDAcrypt
• Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
• EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM
• Enhanced public key security for the McEliece cryptosystem
• scientific article; zbMATH DE number 3650737 (Why is no real title available?)
• scientific article; zbMATH DE number 3989251 (Why is no real title available?)
• scientific article; zbMATH DE number 826242 (Why is no real title available?)
• scientific article; zbMATH DE number 894528 (Why is no real title available?)
• McEliece and Niederreiter cryptosystems that resist quantum Fourier sampling attacks
• Normal subgroup reconstruction and quantum computation using group representations
• Permutation groups, minimal degrees and quantum computing.
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• QC-LDPC code-based cryptography
• Quantum mechanical algorithms for the nonabelian hidden subgroup problem
• Reducing Key Length of the McEliece Cryptosystem
• The hidden subgroup problem and permutation group theory
• The Hidden Subgroup Problem and Quantum Computation Using Group Representations

Cited in

(2)

• McEliece and Niederreiter cryptosystems that resist quantum Fourier sampling attacks
• Efficient Encryption From Random Quasi-Cyclic Codes

This page was built for publication: Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6047445)