arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1402.3264cs.CRcs.ITmath.ITmath.NT
收藏

对二次扩张上的野生McEliece的多项式时间攻击

Polynomial Time Attack on Wild McEliece Over Quadratic Extensions

Alain Couvreur, Ayoub Otmani, Jean-Pierre Tillich

备注：
The material of this article was presented at the conference EUROCRYPT 2014 (Copenhagen, Denmark) and published in its proceedings. Due to space constraints, most of the proofs were omitted in the proceedings version. The present article is a long revisited version including all the missing proofs
阅读 PDF
arXiv 页面 ↗HTML 原文 ↗

摘要：

提出了一种基于Wild Goppa码的二次有限域扩张的多项式时间结构攻击。这种攻击利用这样的代码可以从随机代码中区分出来的事实来计算一些过滤，也就是说，一系列嵌套的子码将揭示它们的秘密代数描述。

英文摘要：

We present a polynomial time structural attack against the McEliece system based on Wild Goppa codes from a quadratic finite field extension. This attack uses the fact that such codes can be distinguished from random codes to compute some filtration, that is to say a family of nested subcodes which will reveal their secret algebraic description.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

↑