搜索结果: 1-2 共查到“军事学 non-prime fields”相关记录2条 . 查询时间(0.352 秒)
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...
On the security of pairing-friendly abelian varieties over non-prime fields
pairing-friendly abelian non-prime fields pairing-based cryptosystem
2009/6/9
Let A be an abelian variety defined over a non-prime finite
field Fq that has embedding degree k with respect to a subgroup of prime
order r. In this paper we give explicit conditions on q, k, and r...