搜索结果: 1-6 共查到“军事学 Polynomial Selection”相关记录6条 . 查询时间(0.265 秒)
A Generalisation of the Conjugation Method for Polynomial Selection for the Extended Tower Number Field Sieve Algorithm
finite fields discrete logarithm tower number field sieve
2016/6/2
In a recent work, Kim and Barbulescu showed how to combine previous polynomial selection methods with the extended tower number field sieve algorithm to obtain improved complexity for the discrete log...
A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm
Discrete Log Tower Number Field Sieve
2016/5/24
In a recent work, Kim and Barbulescu had extended the tower number field sieve algorithm to obtain improved asymptotic complexities in the medium prime case for the discrete logarithm problem on Fpn w...
Tower Number Field Sieve Variant of a Recent Polynomial Selection Method
TNFS Recent Polynomial Selection Method
2016/4/25
At Asiacrypt 2015, Barbulescu et al. performed a thorough analysis of the tower number field sieve (TNFS) variant of the number field sieve algorithm. More recently, Kim and Barbulescu combined the TN...
polynomial selection for the number field sieve in geometric view
cryptography number field sieve
2014/3/10
Polynomial selection is the first important step in number field sieve. A good polynomial not only can produce more relations in the sieving step, but also can reduce the matrix size. In this paper, w...
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...