搜索结果: 1-3 共查到“军事学 prime finite fields”相关记录3条 . 查询时间(0.077 秒)
Faster individual discrete logarithms in non-prime finite fields with the NFS and FFS algorithms
finite field discrete logarithm number field sieve
2016/7/13
Computing discrete logarithms in finite fields is a main concern in cryptography. The best algorithms known are the Number Field Sieve and its variants in large and medium characteristic fields (e.g. ...
Improving NFS for the discrete logarithm problem in non-prime finite fields
Discrete logarithm computation NFS
2016/6/12
The aim of this work is to investigate the hardness of the discrete logarithm problem in fields GF(pn) where n is a small integer greater than 1. Though less studied than the small characteristic case...
A reduction of the space for the parallelized Pollard lambda search on elliptic curves over prime finite fields and on anomalous binary elliptic curves
parallelized Pollard lambda elliptic curves prime finite fields binary elliptic curves
2009/4/9
Let E be an elliptic curve defined over a prime finite field Fp by a
Weierstrass equation. In this paper we introduce a new partition of E(Fp)
into classes which are generally larger than f§Rg. We g...