搜索结果: 1-6 共查到“军事学 four-dimensional”相关记录6条 . 查询时间(0.156 秒)
We apply Smith's construction to generate four-dimensional GLV curves with fast arithmetic in the group law as well as in the base field. As Costello and Longa did in [5] for a 128-bit security level,...
FourQ: four-dimensional decompositions on a Q-curve over the Mersenne prime
four-dimensional decompositions Mersenne prime
2015/12/29
We introduce FourQ, a high-security, high-performance elliptic curve that targets the 128-
bit security level. At the highest arithmetic level, cryptographic scalar multiplications on FourQ can use
...
The Gallant-Lambert-Vanstone (GLV) algorithm uses efficiently computable endomorphisms to accelerate the computation of scalar multiplication of points on an abelian variety. Freeman and Satoh propose...
Four-Dimensional Gallant-Lambert-Vanstone Scalar Multiplication
implementation / Elliptic curves GLV scalar multiplication GLV curves
2012/3/22
The GLV method of Gallant, Lambert and Vanstone~(CRYPTO 2001) computes any multiple $kP$ of a point $P$ of prime order $n$ lying on an elliptic curve with a low-degree endomorphism $\Phi$ (called GLV ...
Four-Dimensional Gallant-Lambert-Vanstone Scalar Multiplication
implementation / Elliptic curves GLV scalar multiplication GLV curves
2012/3/21
The GLV method of Gallant, Lambert and Vanstone~(CRYPTO 2001) computes any multiple $kP$ of a point $P$ of prime order $n$ lying on an elliptic curve with a low-degree endomorphism $\Phi$ (called GLV ...
Four-Dimensional Gallant-Lambert-Vanstone Scalar Multiplication
implementation / Elliptic curves GLV scalar multiplication
2012/6/14
The GLV method of Gallant, Lambert and Vanstone~(CRYPTO 2001) computes any multiple $kP$ of a point $P$ of prime order $n$ lying on an elliptic curve with a low-degree endomorphism $\Phi$ (called GLV ...