1994•Lecture notes in computer scienceRequires access

A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields

Leonard M. Adleman, Jonathan DeMarrais, Ming-Deh A. Huang

Open publisher page 148 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 148 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: Discrete logarithm, Hyperelliptic curve cryptography, Hyperelliptic curve, Finite field, Logarithm, Mathematics, Jacobian matrix and determinant, Genus

Back to paper search Browse research topics Original source

A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields — Research Paper | ScholarLens