搜索结果: 1-15 共查到“军事学 Number Field Sieve”相关记录19条 . 查询时间(0.062 秒)
On the alpha value of polynomials in the tower number field sieve algorithm
number field sieve discrete logarithm pairing-friendly curve
2019/8/2
In this paper, we provide a notable step towards filling the gap between theory (estimates of running-time) and practice (a discrete logarithm record computation) for the Tower Number Field Sieve (TNF...
Higher dimensional sieving for the number field sieve algorithms
public-key cryptography exTNFS
2018/11/6
Since 2016 and the introduction of the exTNFS (extended Tower Number Field Sieve) algorithm, the security of cryptosystems based on non- prime finite fields, mainly the paring and torus-based one, is ...
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...
Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
Discrete Logarithm Problem Number Field Sieve Finite Fields
2016/5/30
In a recent work, Kim and Barbulescu~(CRYPTO~2016) proposed an algorithm, called exTNFS, that improves asymptotic complexity for the discrete logarithm problems over Fpn in medium prime case, when the...
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...
Collecting relations for the Number Field Sieve in $GF(p^6)$
the Number Field Sieve public-key cryptography
2016/2/23
In order to assess the security of cryptosystems based on the discrete logarithm problem in
non-prime finite fields, as are the torus-based or pairing-based ones, we investigate thoroughly
the case ...
The Multiple Number Field Sieve for Medium and High Characteristic > Finite Fields
public-key cryptography discrete logarithm problem
2016/1/25
In this paper, we study the discrete logarithm problem in medium and high characteristic finite fields. We propose a variant of the Number Field Sieve (NFS) based on numerous number fields. Our improv...
The Multiple Number Field Sieve with Conjugation Method
Discrete Logarithm Finite Field Medium Characteristic
2016/1/7
In this paper, we propose two variants of the Number Field Sieve (NFS) to compute
discrete logarithms in medium characteristic finite fields. We consider algorithms that
combine two ideas, namely th...
The security of pairing-based crypto-systems relies on the
difficulty to compute discrete logarithms in finite fields Fpn where n is
a small integer larger than 1. The state-of-art algorithm is the ...
New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields
New Complexity Trade-Offs the (Multiple) Number Field Sieve Algorithm
2015/12/22
The selection of polynomials to represent number fields crucially determines the efficiency of the Number Field Sieve (NFS) algorithm for solving the discrete log problem in a finite field. An importa...
Extended Tower Number Field Sieve: A New Complexity for Medium Prime Case
Discrete Logarithm Problem Number Field Sieve Finite Fields Cryptanalysis
2015/12/22
In this paper, we extend the tower number field sieve~(TNFS) proposed by Barbulescu, Gaudry, and Kleinjung in Asaicrypt 2015. Our generalization based on the JLSV algorithm (by Joux, Lercier, Smart, a...
A construction of 3-dimensional lattice sieve for number field sieve over F_{p^n}
public-key cryptography number field sieve
2015/12/18
The security of pairing-based cryptography is based on the hardness of
solving the discrete logarithm problem (DLP) over extension field GF(p
n
) of characteristic
p and degree n. Joux et al. prop...
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...
The Special Number Field Sieve in $\F _{p^{n}}$, Application to Pairing-Friendly Constructions
Discrete logarithms SNFS
2014/3/10
In this paper, we study the discrete logarithm problem in finite fields related to pairing-based curves. We start with a precise analysis of the state-of-the-art algorithms for computing discrete loga...