搜索结果: 1-5 共查到“军事学 GHS attack”相关记录5条 . 查询时间(0.064 秒)
A classification of elliptic curves with respect to the GHS attack in odd characteristic
Elliptic curve cryptosystems Hyperelliptic curve cryptosystems Index calculus
2015/12/24
The GHS attack is known to solve discrete logarithm problems (DLP) in the Jacobian of a curve C_0 defined over the d degree extension field k_d of k:=GF(q) by mapping it to the DLP in the Jacobian of ...
Classification of Elliptic/hyperelliptic Curves with Weak Coverings against GHS Attack under an Isogeny Condition
Weil descent attack GHS attack
2014/3/11
The GHS attack is known as a method to map the discrete logarithm problem(DLP) in the Jacobian of a curve C_{0} defined over the d degree extension k_{d} of a finite field k to the DLP in the Jacobian...
Classification of Elliptic/hyperelliptic Curves with Weak Coverings against GHS Attack without Isogeny Condition
Weil descent attack GHS attack Elliptic curve cryptosystems
2009/12/29
The GHS attack is known as a method to map the discrete loga-
rithm problem(DLP) in the Jacobian of a curve C0 defined over the d
degree extension kd of a finite field k to the DLP in the Jacobian o...
On Implementation of GHS Attack against Elliptic Curve Cryptosystems over Cubic Extension Fields of Odd Characteristics
Elliptic curve cryptosystems Discrete logarithm problem GHS attack
2009/6/4
In this paper, we present algorithms for implementation of the GHS attack to Elliptic
curve cryptosystems (ECC). In particular, we consider two large classes of elliptic curves
over cubic extension ...
CRYPTOGRAPHIC IMPLICATIONS OF HESS'GENERALIZED GHS ATTACK
Elliptic curve cryptography Weil descent Isogenies
2009/3/27
A finite field K is said to be weak for elliptic curve cryp-
tography if all instances of the discrete logarithm problem for all elliptic
curves over K can be solved in significantly less time than ...