Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields
From MaRDI portal
Publication:1949237
DOI10.1007/s10623-012-9611-8zbMath1277.11069MaRDI QIDQ1949237
Publication date: 6 May 2013
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-012-9611-8
94A60: Cryptography
11G20: Curves over finite and local fields
14G50: Applications to coding theory and cryptography of arithmetic geometry
Related Items
Identity-based undetachable digital signature for mobile agents in electronic commerce, Heuristics on pairing-friendly abelian varieties
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
- The Magma algebra system. I: The user language
- A taxonomy of pairing-friendly elliptic curves
- Constructing pairing-friendly hyperelliptic curves using Weil restriction
- Ordinary Abelian varieties having small embedding degree
- Pairings on hyperelliptic curves
- A Hyperelliptic Smoothness Test, II
- Abelian Varieties with Prescribed Embedding Degree
- 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
- Families of genus 2 curves with small embedding degree
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Examples of genus two CM curves defined over the rationals
- Constructing hyperelliptic curves of genus 2 suitable for cryptography
- Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians
- The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography
- Selected Areas in Cryptography
- On the difference between consecutive primes
