Discrete logarithms in curves over finite fields
Andreas Enge (INRIA Futurs)
TL;DR
This paper surveys algorithms for computing discrete logarithms in Jacobians of curves over finite fields, providing an overview of current methods and their efficiencies.
Contribution
It offers a comprehensive review of existing algorithms for discrete logarithms in curve Jacobians over finite fields, highlighting recent advances.
Findings
Summarizes key algorithms and their complexities
Identifies open problems and research directions
Provides comparative analysis of methods
Abstract
A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.