Algorithmic Number Theory
From MaRDI portal
Publication:5465621
DOI10.1007/b98210zbMath1125.11360OpenAlexW2791103999WikidataQ29036695 ScholiaQ29036695MaRDI QIDQ5465621
Publication date: 12 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98210
characteristic polynomial of Frobenius endomorphism2-dimensional pseudo-random walkgroup order of the Jacobian of a genus 2 curve over a finite fieldlow memory algorithm
Number-theoretic algorithms; complexity (11Y16) Parallel algorithms in computer science (68W10) Curves over finite and local fields (11G20) Randomized algorithms (68W20)
Related Items (17)
Implementation of point-counting algorithms on genus 2 hyperelliptic curves based on the birthday paradox ⋮ Point counting on Picard curves in large characteristic ⋮ Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm ⋮ A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity ⋮ Genus 2 point counting over prime fields ⋮ Counting points on genus-3 hyperelliptic curves with explicit real multiplication ⋮ A non-uniform birthday problem with applications to discrete logarithms ⋮ On the distribution of the coefficients of normal forms for Frobenius expansions ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Solving Discrete Logarithm Problem in an Interval Using Periodic Iterates ⋮ ON THE COMPLEXITY OF DISCRETE LOGARITHM PROBLEM IN AN INTERVAL IN A FINITE CYCLIC GROUP WITH EFFICIENT INVERSION ⋮ О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом ⋮ Computing discrete logarithms in an interval ⋮ A low-memory algorithm for point counting on Picard curves ⋮ Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem ⋮ Non-uniform birthday problem revisited: refined analysis and applications to discrete logarithms ⋮ Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms
Uses Software
This page was built for publication: Algorithmic Number Theory
