Pairings on hyperelliptic curves
From MaRDI portal
Publication:2998239
zbMATH Open1214.14021arXiv0908.3731MaRDI QIDQ2998239FDOQ2998239
Juliana V. Belding, Edlyn Teske, Kirsten Eisenträger, Sarah Chisholm, Katherine E. Stange, Jennifer S. Balakrishnan
Publication date: 18 May 2011
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.
Full work available at URL: https://arxiv.org/abs/0908.3731
Recommendations
Cryptography (94A60) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cited In (13)
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
- Adelic and idelic pairings related to Weil reciprocity on algebraic curves
- Ate Pairing on Hyperelliptic Curves
- On the number of the pairing-friendly curves
- Title not available (Why is that?)
- Cryptography and Coding
- Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields
- Hyperelliptic Pairings
- ON BOUNDS FOR BALANCED EMBEDDING DEGREE
- Title not available (Why is that?)
- Pairings on Hyperelliptic Curves with a Real Model
- Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\)
- Algorithmic Number Theory
This page was built for publication: Pairings on hyperelliptic curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2998239)