搜索结果: 1-2 共查到“军队指挥学 geometric progression”相关记录2条 . 查询时间(0.085 秒)
On Nonlinear Polynomial Selection and Geometric Progression (mod N) for Number Field Sieve
foundations / Polynomial Selection Number Field Sieve LLL Algorithm
2012/3/28
The general number field sieve (GNFS) is asymptotically the fastest known factoring algorithm. One of the most important steps of GNFS is to select a good polynomial pair. A standard way of polynomial...
On Nonlinear Polynomial Selection and Geometric Progression (mod N) for Number Field Sieve
Polynomial Selection Number Field Sieve LLL Algorithm
2011/6/9
The general number field sieve (GNFS) is asymptotically the fastest known factoring algorithm. One of the most important steps of GNFS is to select a good polynomial pair. A standard way of polynomial...