关于NFS中多项式选择的数学注记
Some mathematical remarks on the polynomial selection in NFS
摘要:
在这项工作中,我们考虑的比例顺利(免费的大素因子)值的二进制形式$F(X_1,X_2)\in\Z[X_1,X_2]$。在一个特殊的情况下,我们给这个比例取决于$F$的渐近等价。这与墨菲的$α$函数有关,该函数在密码学界是已知的,但以前从未从数学的角度进行过研究。我们的结果证明,当$α(F)$是小的,$F$有一个高比例的光滑值。这对整数分解的最快算法Number Field Sieve的第一步(称为多项式选择)有影响。
英文摘要:
In this work, we consider the proportion of smooth (free of large prime factors) values of a binary form $F(X_1,X_2)\in\Z[X_1,X_2]$. In a particular case, we give an asymptotic equivalent for this proportion which depends on $F$. This is related to Murphy's $α$ function, which is known in the cryptographic community, but which has not been studied before from a mathematical point of view. Our result proves that, when $α(F)$ is small, $F$ has a high proportion of smooth values. This has consequences on the first step, called polynomial selection, of the Number Field Sieve, the fastest algorithm of integer factorization.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。