A general framework for subexponential discrete logarithm algorithms
From MaRDI portal
Publication:2781453
DOI10.4064/aa102-1-6zbMath1028.11079OpenAlexW1976203617MaRDI QIDQ2781453
Publication date: 20 March 2002
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4064/aa102-1-6
Arithmetic theory of algebraic function fields (11R58) Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20)
Related Items (32)
A simple method for obtaining relations among factor basis elements for special hyperelliptic curves ⋮ Smooth ideals in hyperelliptic function fields ⋮ A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point ⋮ The arithmetic of Jacobian groups of superelliptic cubics ⋮ Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree ⋮ Field extensions and index calculus on algebraic curves ⋮ Index calculus in the trace zero variety ⋮ A new perspective on the powers of two descent for discrete logarithms in finite fields ⋮ An \(L(1/3)\) discrete logarithm algorithm for low degree curves ⋮ On the discrete logarithm problem in finite fields of fixed characteristic ⋮ Using symmetries in the index calculus for elliptic curves discrete logarithm ⋮ Extending the GLS endomorphism to speed up GHS Weil descent using Magma ⋮ ON BOUNDS FOR BALANCED EMBEDDING DEGREE ⋮ HYPERELLIPTIC CURVES, CARTIER — MANIN MATRICES AND LEGENDRE POLYNOMIALS ⋮ A new method for decomposition in the Jacobian of small genus hyperelliptic curves ⋮ Index calculus attack for Jacobian of hyperelliptic curves of small genus using two large primes ⋮ Algebraic curves and cryptography ⋮ Cryptographic implications of Hess' generalized GHS attack ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ Smoothness testing of polynomials over finite fields ⋮ Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem ⋮ Computation of a 30750-bit binary field discrete logarithm ⋮ Об алгоритмах построения изогений эллиптических кривых над конечными полями и их приложениях ⋮ On the discrete logarithm problem in class groups of curves ⋮ Index calculus in class groups of non-hyperelliptic curves of genus three ⋮ Koblitz curves over quadratic fields ⋮ On the complexity of the discrete logarithm and Diffie-Hellman problems ⋮ Curves, Jacobians, and cryptography ⋮ A double large prime variation for small genus hyperelliptic index calculus ⋮ Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic ⋮ Constructive and destructive facets of Weil descent on elliptic curves ⋮ Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields
This page was built for publication: A general framework for subexponential discrete logarithm algorithms
