Zhixiong Chen, Zhenjie Huang
Abstract
In hyperelliptic curve cryptosystems,it is one of the main steps in computing scalar multiplication to evaluate 2D+E from the given elements D and E in the Jacobian of a hyperelliptic curve.In this paper,an optimized method for computing 2D+E is proposed,which will raise the computing efficiency by about 6%~8%.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In hyperelliptic curve cryptosystems,it is one of the main steps in computing scalar multiplication to evaluate 2D+E from the given elements D and E in the Jacobian of a hyperelliptic curve.In this paper,an optimized method for computing 2D+E is proposed,which will raise the computing efficiency by about 6%~8%.
Key concepts: Hyperelliptic curve, Hyperelliptic curve cryptography, Jacobian matrix and determinant, Scalar multiplication, Scalar (mathematics), Cryptosystem, Jacobian curve, Mathematics