2002•Lecture notes in computer scienceRequires access

An Improved Baby Step Giant Step Algorithm for Point Counting of Hyperelliptic Curves over Finite Fields

Kazuto Matsuo, Jinhui Chao, Shigeo Tsujii

Open publisher page 36 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 36 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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.

Key concepts: Hyperelliptic curve, Hyperelliptic curve cryptography, Algorithm, Mathematics, Jacobian matrix and determinant, Square root, Finite field, Modulo

Back to paper search Browse research topics Original source

An Improved Baby Step Giant Step Algorithm for Point Counting of Hyperelliptic Curves over Finite Fields — Research Paper | ScholarLens