Weil descent of Jacobians

Authors:
Steven D. Galbraith
Affiliations:
Mathematics Department, Royal Holloway University of London, Egham, Surrey TW20 0EX, UK
Venue:
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Year:
2003

Citing 4
Cited 3

Hyperelliptic cryptosystems

Journal of Cryptology
Speeding up the Discrete Log Computation on Curves with Automorphisms

ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields

ANTS-I Proceedings of the First International Symposium on Algorithmic Number Theory
An algorithm for solving the discrete log problem on hyperelliptic curves

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

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

ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Algebraic curves and cryptography

Finite Fields and Their Applications
High-Performance scalar multiplication using 8-dimensional GLV/GLS decomposition

CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The technique of Weil restriction of scalars has significant implications for elliptic curve cryptography. In this paper we apply these ideas to the case of the discrete logarithm problem in the Jacobian of a curve of genus greater than one over a finite field Fqn where n 1.