A low-memory algorithm for point counting on Picard curves
From MaRDI portal
Publication:2491278
DOI10.1007/s10623-005-1598-yzbMath1172.11313OpenAlexW2075598124MaRDI QIDQ2491278
Publication date: 29 May 2006
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-005-1598-y
Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Special algebraic curves and curves of low genus (14H45) Curves over finite and local fields (11G20)
Related Items (2)
A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity ⋮ Index calculus in class groups of non-hyperelliptic curves of genus three
Cites Work
- Unnamed Item
- Parallel collision search with cryptanalytic applications
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Point counting on Picard curves in large characteristic
- Algorithmic Number Theory
- Advances in Cryptology - ASIACRYPT 2003
This page was built for publication: A low-memory algorithm for point counting on Picard curves