当前位置: X-MOL 学术Adv. Math. Commun. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling
Advances in Mathematics of Communications ( IF 0.9 ) Pub Date : 2021-12-17 , DOI: 10.3934/amc.2021062
Upendra Kapshikar , , Ayan Mahalanobis ,

<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>

中文翻译:

使用抗量子傅里叶采样的准循环码的 Niederreiter 密码系统

<p style='text-indent:20px;'>McEliece 和 Niederreiter 密码系统是强大且通用的密码系统。这些密码系统与许多线性纠错码一起工作。它们现在很受欢迎,因为它们可以是量子安全的。在本文中,我们研究了使用非二进制准循环码的 Niederreiter 密码系统。我们证明,如果这些准循环码满足一定条件,则相应的尼德雷特密码系统可以抵抗使用弱量子傅里叶采样的隐子群问题。尽管我们的工作使用了弱傅里叶采样,但我们认为其结论对于强傅里叶采样也应该是有效的。</p>
更新日期:2021-12-17
down
wechat
bug