syzygy区分器
The syzygy distinguisher
AI总结:
提出一种针对交替码和Goppa码的次指数复杂度区分器,利用缩短对偶码的graded Betti数,首次在CPA模型下突破McEliece密码系统的指数障碍。
摘要:
我们提出了一种针对交替码和Goppa码的新型区分器,其复杂度在纠错能力上是次指数的,因此优于通用解码算法。此外,它不受先前区分器或结构恢复算法在强体制限制方面的困扰:特别是,它适用于后量子密码标准化中Classic McEliece候选方案所使用的码。使我们能够区分的不变量是缩短对偶码的齐次坐标环的graded Betti数。自1978年引入以来,这是首次在CPA模型下对McEliece密码系统的分析突破了指数障碍。
英文摘要:
We present a new distinguisher for alternant and Goppa codes, whose complexity is subexponential in the error-correcting capability, hence better than that of generic decoding algorithms. Moreover it does not suffer from the strong regime limitations of the previous distinguishers or structure recovery algorithms: in particular, it applies to the codes used in the Classic McEliece candidate for postquantum cryptography standardization. The invariants that allow us to distinguish are graded Betti numbers of the homogeneous coordinate ring of a shortening of the dual code. Since its introduction in 1978, this is the first time an analysis (in the CPA model) of the McEliece cryptosystem breaks the exponential barrier.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。