A generic approach to searching for Jacobians
type: Item
instance of: scholarly article
title: A generic approach to searching for Jacobians
zbMATH Open document ID: 1208.14020
DOI: 10.1090/S0025-5718-08-02143-1
author: Andrew V. Sutherland
published in: Mathematics of Computation
publication date: 2010-11-07T00:00:00Z
full work available at URL: https://arxiv.org/abs/0708.3168
Mathematics Subject Classification ID: 14G50
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 11G20
Mathematics Subject Classification ID: 11M38
zbMATH DE Number: 5813055
zbMATH Keywords: Jacobian variety
zbMATH Keywords: zeta function
zbMATH Keywords: hyperelliptic curve
describes a project that uses: gmp
describes a project that uses: HECC
MaRDI profile type: Publication
arXiv ID: 0708.3168
cites work: Asymptotic semismoothness probabilities
cites work: Algorithmic Number Theory
cites work: The arithmetic of Jacobian groups of superelliptic cubics
cites work: Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator
cites work: On some computational problems in finite abelian groups
cites work: Computing the structure of a finite abelian group
cites work: On a problem of Oppenheim concerning ''Factorisatio Numerorum''
cites work: Computing in the Jacobian of a Hyperelliptic Curve
cites work: Q3139838
cites work: Handbook of Elliptic and Hyperelliptic Curve Cryptography
cites work: Q4450525
cites work: Q4213383
cites work: Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time
cites work: Public Key Cryptography – PKC 2004
cites work: Fast addition on non-hyperelliptic genus 3 curves
cites work: Q2712108
cites work: Selected Areas in Cryptography
cites work: Constructive and destructive facets of Weil descent on elliptic curves
cites work: A double large prime variation for small genus hyperelliptic index calculus
cites work: Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Counting Points in Medium Characteristic Using Kedlaya's Algorithm
cites work: Kedlaya's Algorithm in Larger Characteristic
cites work: Q4542306
cites work: Asymptotically fast group operations on Jacobians of general curves
cites work: Q4398780
cites work: Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
cites work: Q4665918
cites work: Formulae for arithmetic on genus 2 hyperelliptic curves
cites work: Pairing Based Threshold Cryptography Improving on Libert-Quisquater and Baek-Zheng
cites work: Factoring integers with elliptic curves
cites work: Q4871722
cites work: Q4737507
cites work: Q4718481
cites work: Modular Multiplication Without Trial Division
cites work: Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields
cites work: Q4046106
cites work: The canonical lift of an ordinary elliptic curve over a finite field and its point counting
cites work: A Monte Carlo Factoring Algorithm With Linear Storage
cites work: Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
cites work: Counting points on elliptic curves over finite fields
cites work: Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves
cites work: Explicit bounds and heuristics on class numbers in hyperelliptic function fields
cites work: A space efficient algorithm for group structure computation
cites work: The Pohlig-Hellman method generalized for group structure computation
cites work: Advances in Cryptology - ASIACRYPT 2003
cites work: Q4444944
cites work: Q4409130
cites work: Numbers of solutions of equations in finite fields
cites work: Q4542307
cites work: Constructing hyperelliptic curves of genus 2 suitable for cryptography
description: scientific article