Implementation of point-counting algorithms on genus 2 hyperelliptic curves based on the birthday paradox
From MaRDI portal
Publication:5071233
DOI10.17223/20710410/55/9OpenAlexW4285133424MaRDI QIDQ5071233
Publication date: 20 April 2022
Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/pdm765
Uses Software
Cites Work
- Unnamed Item
- Genus 2 point counting over prime fields
- Probability to meet in the middle
- Parallel collision search with cryptanalytic applications
- Jacobian coordinates on genus 2 curves
- Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval
- An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems
- Counting Points in Medium Characteristic Using Kedlaya's Algorithm
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Algorithmic Number Theory
This page was built for publication: Implementation of point-counting algorithms on genus 2 hyperelliptic curves based on the birthday paradox