scientific article; zbMATH DE number 1504543

MaRDI QIDQ4502491zbMATH OpenFDO

Authors Pierrick Gaudry, François Morain, Iwan Duursma

Publication date 4 January 2001

zbMATH Keywords

automorphismsdiscrete logarithmelliptic curveshyperelliptic curves

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Computational aspects of algebraic curves (14Q05) Cryptography (94A60)

Cited in

(17)

• Koblitz curve cryptosystems
• Weil descent of Jacobians.
• Remarks on the zeta function of some diagonal hyperelliptic curves
• New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0
• A taxonomy of pairing-friendly elliptic curves
• Finding composite order ordinary elliptic curves using the Cocks-Pinch method
• Fast cryptography in genus 2
• Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem
• Speeding Up the Pollard Rho Method on Prime Fields
• Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
• Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields
• Accelerating Pollard's rho algorithm on finite fields
• Endomorphisms for faster elliptic curve cryptography on a large class of curves
• Computing elliptic curve discrete logarithms with the negation map
• О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом
• The special case of cyclotomic fields in quantum algorithms for unit groups
• Computing bilinear pairings on elliptic curves with automorphisms

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4502491)