2009•International Conference on Advanced Communication TechnologyRequires access

A new scalar multiplication method suitable for hyperelliptic curve cryptosystems

Chen Xiao-e, Lin You

Abstract

We describe a new scalar multiplication method for hyperelliptic curve cryptosystems. The method is obtained by the decomposition of the divisor into the simple divisors. The comparison results show that our method is much more efficient than Frobenius method and Double-and-Add method for some special hyperelliptic curves.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Hyperelliptic curve, Scalar multiplication, Hyperelliptic curve cryptography, Mathematics, Scalar (mathematics), Divisor (algebraic geometry), Simple (philosophy), Cryptosystem