arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1706.08447math.NTcs.CR
收藏

小特征下DLP拟多项式时间算法的多项式选取

On the selection of polynomials for the DLP quasi-polynomial time algorithm in small characteristic

Giacomo Micheli

摘要:

本文刻画了多项式集合$f\in\mathbb F_q[X]$满足以下性质:存在正整数$d$使得对任何小于或等于$f$次数的正整数$\ell$,存在$t_0$在$\mathbb F_{q^d}$中使得多项式$f-t_0$在$\mathbb F_{q^d}[X]$上有一个次数不可约因子$\ell$.最后一步是从求解小特征离散对数问题的一个拟多项式时间算法中去除启发式。我们的表征允许建设多项式满足所需的财产。该方法是通用的,可用于解决类似的问题,涉及有限域上多项式的因式分解模式。

英文摘要:

In this paper we characterize the set of polynomials $f\in\mathbb F_q[X]$ satisfying the following property: there exists a positive integer $d$ such that for any positive integer $\ell$ less or equal than the degree of $f$, there exists $t_0$ in $\mathbb F_{q^d}$ such that the polynomial $f-t_0$ has an irreducible factor of degree $\ell$ over $\mathbb F_{q^d}[X]$. This result is then used to progress in the last step which is needed to remove the heuristic from one of the quasi-polynomial time algorithms for discrete logarithm problems (DLP) in small characteristic. Our characterization allows a construction of polynomials satisfying the wanted property. The method is general and can be used to tackle similar problems which involve factorization patterns of polynomials over finite fields.

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

↑