Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields
type: Item
instance of: scholarly article
title: Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields
zbMATH Open document ID: 1277.11069
author: Ning Shang
author: Kristin Lauter
published in: Designs, Codes and Cryptography
publication date: 2013-05-06T00:00:00Z
Mathematics Subject Classification ID: 11G20
Mathematics Subject Classification ID: 14G50
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6160870
zbMATH Keywords: public-key cryptography
zbMATH Keywords: hyperelliptic curve cryptography
zbMATH Keywords: pairing-friendly parameters
describes a project that uses: Magma
MaRDI profile type: Publication
full work available at URL: s10623-012-9611-8
OpenAlex ID: W2025579664
cites work: Pairings on hyperelliptic curves
cites work: The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
cites work: The Magma algebra system. I: The user language
cites work: Q3593464
cites work: Q3000305
cites work: Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians
cites work: A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties
cites work: Abelian Varieties with Prescribed Embedding Degree
cites work: A taxonomy of pairing-friendly elliptic curves
cites work: Constructing pairing-friendly hyperelliptic curves using Weil restriction
cites work: Selected Areas in Cryptography
cites work: Ordinary Abelian varieties having small embedding degree
cites work: Q2739453
cites work: The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography
cites work: Families of genus 2 curves with small embedding degree
cites work: On the difference between consecutive primes
cites work: Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax
cites work: A Hyperelliptic Smoothness Test, II
cites work: Q3973343
cites work: An improved algorithm for computing logarithms over&lt;tex&gt;GF(p)&lt;/tex&gt;and its cryptographic significance (Corresp.)
cites work: Q4409128
cites work: Examples of genus two CM curves defined over the rationals
cites work: Q5795562
cites work: Constructing hyperelliptic curves of genus 2 suitable for cryptography
DOI: 10.1007/S10623-012-9611-8
description: scientific article; zbMATH DE number 6160870