Constructing pairing-friendly hyperelliptic curves using Weil restriction
DOI10.1016/J.JNT.2010.06.003zbMATH Open1245.11075OpenAlexW2077250322MaRDI QIDQ2430992FDOQ2430992
Authors: David M. Freeman, Takakazu Satoh
Publication date: 8 April 2011
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jnt.2010.06.003
Recommendations
- Ordinary pairing-friendly genus 2 hyperelliptic curves with absolutely simple Jacobians
- Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians
- Generating more Kawazoe-Takahashi genus 2 pairing-friendly hyperelliptic curves
- Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax
- Constructing pairing-friendly genus 2 curves with split Jacobian
Cryptography (94A60) Curves over finite and local fields (11G20) Finite ground fields in algebraic geometry (14G15) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- The Magma algebra system. I: The user language
- A taxonomy of pairing-friendly elliptic curves
- Title not available (Why is that?)
- Title not available (Why is that?)
- Abelian Surfaces over Finite Fields as Jacobians
- Abelian varieties over finite fields
- Examples of genus two CM curves defined over the rationals
- Selected Areas in Cryptography
- Advances in Elliptic Curve Cryptography
- Title not available (Why is that?)
- The vector decomposition problem for elliptic and hyperelliptic curves
- Adèles and algebraic groups. (Appendix 1: The case of the group \(G_2\), by M. Demazure. Appendix 2: A short survey of subsequent research on Tamagawa numbers, by T. Ono)
- Endomorphisms of Abelian varieties over finite fields
- Twisting commutative algebraic groups
- Efficient Hyperelliptic Arithmetic Using Balanced Representation for Divisors
- Title not available (Why is that?)
- Pairings on Hyperelliptic Curves with a Real Model
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
- Title not available (Why is that?)
- Elliptic curves suitable for pairing based cryptography
- Advances in Cryptology - EUROCRYPT 2004
- A study on theoretical and practical aspects of Weil-restrictions of varieties
- Elliptic Curves and Primality Proving
- A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
- Curves with infinite \(K\)-rational geometric fundamental group
- Using abelian varieties to improve pairing-based cryptography
- Algorithmic Number Theory
- On the Minimal Embedding Field
- Choosing the correct elliptic curve in the CM method
- Abelian Varieties with Prescribed Embedding Degree
- Constructing pairing-friendly hyperelliptic curves using Weil restriction
- A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties
- Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax
- Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields
- On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields
Cited In (16)
- Hyperelliptic curves, Cartier-Manin matrices and Legendre polynomials
- Ordinary pairing-friendly genus 2 hyperelliptic curves with absolutely simple Jacobians
- Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax
- Identity-based undetachable digital signature for mobile agents in electronic commerce
- A new twofold Cornacchia-type algorithm and its applications
- Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields
- Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians
- Rational points on certain families of symmetric equations
- ON BOUNDS FOR BALANCED EMBEDDING DEGREE
- Constructing pairing-friendly hyperelliptic curves using Weil restriction
- Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree
- Parametrizing the moduli space of curves and applications to smooth plane quartics over finite fields
- Constructing pairing-friendly genus 2 curves with split Jacobian
- A new method for constructing pairing-friendly abelian surfaces
- Generating more Kawazoe-Takahashi genus 2 pairing-friendly hyperelliptic curves
- Hyper-and-elliptic-curve cryptography
Uses Software
This page was built for publication: Constructing pairing-friendly hyperelliptic curves using Weil restriction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2430992)