Pairings on hyperelliptic curves
Jennifer Balakrishnan, Juliana Belding, Sarah Chisholm, Kirsten, Eisentraeger, Katherine Stange, Edlyn Teske
TL;DR
This paper surveys and unifies recent research on hyperelliptic pairings, focusing on curve construction, pairing computation optimization, and future research directions in pairing-based cryptography.
Contribution
It provides a comprehensive survey and a unifying framework for hyperelliptic pairings, highlighting optimization techniques and future research avenues.
Findings
Compilation of hyperelliptic pairing constructions
Development of a unifying framework for pairings
Discussion of optimization techniques for pairing computation
Abstract
We assemble and reorganize the recent work in the area of hyperelliptic pairings: We survey the research on constructing hyperelliptic curves suitable for pairing-based cryptography. We also showcase the hyperelliptic pairings proposed to date, and develop a unifying framework. We discuss the techniques used to optimize the pairing computation on hyperelliptic curves, and present many directions for further research.
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.
Taxonomy
TopicsCryptography and Residue Arithmetic · Coding theory and cryptography · Algebraic Geometry and Number Theory