搜索结果: 1-15 共查到“军队指挥学 sieve”相关记录31条 . 查询时间(0.046 秒)
On the alpha value of polynomials in the tower number field sieve algorithm
number field sieve discrete logarithm pairing-friendly curve
font style='font-size:12px;'>
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...
The General Sieve Kernel and New Records in Lattice Reduction
cryptanalysis lattice reduction sieving
font style='font-size:12px;'>
2019/1/29
We propose the General Sieve Kernel (G6K, pronounced /ʒe.si.ka/), an abstract stateful machine supporting a wide variety of lattice reduction strategies based on sieving algorithms. Using the bas...
Higher dimensional sieving for the number field sieve algorithms
public-key cryptography exTNFS
font style='font-size:12px;'>
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 ...
Speeding up lattice sieve with Xeon Phi coprocessor
Xeon Phi vector norm
font style='font-size:12px;'>
2017/6/22
Major substep in a lattice sieve algorithm which solves the Euclidean shortest vector problem (SVP) is the computation of sums and Euclidean norms of many vector pairs. Finding a solution to the SVP i...
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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 ...
Fine Tuning the Function Field Sieve Algorithm for the Medium Prime Case
Discrete Log Finite fields Function Field Sieve Cryptography
font style='font-size:12px;'>
2016/1/26
This work builds on the variant of the function field sieve (FFS) algorithm for the
medium prime case introduced by Joux and Lercier in 2006. We make several contributions.
The first contribution us...
The Multiple Number Field Sieve for Medium and High Characteristic > Finite Fields
public-key cryptography discrete logarithm problem
font style='font-size:12px;'>
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...
FFS Factory: Adapting Coppersmith's "Factorization Factory" to the Function Field Sieve
Discrete logarithm Function field sieve Cryptanalysis
font style='font-size:12px;'>
2016/1/9
In 1993, Coppersmith introduced the “factorization factory”
approach as a means to speed up the Number Field Sieve algorithm
(NFS) when factoring batches of integers of similar size: at the expense
...
The Multiple Number Field Sieve with Conjugation Method
Discrete Logarithm Finite Field Medium Characteristic
font style='font-size:12px;'>
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 Tower Number Field Sieve
discrete logarithm number field sieve pairings
font style='font-size:12px;'>
2015/12/30
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
font style='font-size:12px;'>
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...