Pairings on hyperelliptic curves
Authors:
- Jennifer BalakrishnanJBJennifer Balakrishnan
- Juliana BeldingJBJuliana Belding
- Sarah ChisholmSCSarah Chisholm
- Kirsten EisentraegerKEKirsten Eisentraeger
- Katherine StangeKSKatherine Stange
- Edlyn TeskeETEdlyn Teske
Preprint
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.Keywords
All Related Versions
This publication has 29 references indexed in Scilit:
- Homomorphic Encryption and Signatures from Vector Decomposition2008
- Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable AutomorphismsLecture Notes in Computer Science, 2008
- Exponentiation in Pairing-Friendly Groups Using HomomorphismsLecture Notes in Computer Science, 2008
- Novel Efficient Implementations of Hyperelliptic Curve Cryptosystems Using Degenerate DivisorsLecture Notes in Computer Science, 2005
- The Weil Pairing, and Its Efficient CalculationJournal of Cryptology, 2004
- Short Signatures from the Weil PairingJournal of Cryptology, 2004
- A One Round Protocol for Tripartite Diffie–HellmanJournal of Cryptology, 2004
- Implementation of Tate Pairing on Hyperelliptic Curves of Genus 2Lecture Notes in Computer Science, 2004
- Parallel Collision Search with Cryptanalytic ApplicationsJournal of Cryptology, 1999
- Hyperelliptic cryptosystemsJournal of Cryptology, 1989