Generating pairing-friendly elliptic curve parameters using sparse families
DOI10.1515/JMC-2017-0024zbMATH Open1496.94043OpenAlexW2789331349MaRDI QIDQ1640702FDOQ1640702
Authors: Georgios Fotiadis, Elisavet Konstantinou 
Publication date: 14 June 2018
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: http://orbilu.uni.lu/handle/10993/39267
Recommendations
- On constructing parameterized families of pairing-friendly elliptic curves with \(\rho =1\)
- Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction
- On constructing families of pairing-friendly elliptic curves with variable discriminant
- Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials
- Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields
Cryptography (94A60) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50) Elliptic curves (14H52)
Cites Work
- A taxonomy of pairing-friendly elliptic curves
- Pairing-Friendly Elliptic Curves of Prime Order
- Computing Hilbert class polynomials with the Chinese remainder theorem
- Elliptic curves suitable for pairing based cryptography
- Algorithmic Number Theory
- Generating more MNT elliptic curves
- Simple continued fraction solutions for Diophantine equations
- Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
- Building curves with arbitrary small MOV degree over finite prime fields
- Extended tower number field sieve: a new complexity for the medium prime case
- A new method of choosing primitive elements for Brezing-Weng families of pairing-friendly elliptic curves
- Ordinary Abelian varieties having small embedding degree
- Guide to pairing-based cryptography
- On the efficient generation of generalized MNT elliptic curves
- On constructing families of pairing-friendly elliptic curves with variable discriminant
- Constructing pairing-friendly curves with variable CM discriminant
- Generating Pairing-Friendly Curves with the CM Equation of Degree 1
- Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials
Cited In (6)
- On constructing parameterized families of pairing-friendly elliptic curves with \(\rho =1\)
- Constructing polynomials for generating pairing-friendly elliptic curves
- On constructing families of pairing-friendly elliptic curves with variable discriminant
- Polynomial generating pairing and its criterion for optimal pairing
- Faster optimal ate pairings for cyclotomic sparse families of pairing-friendly elliptic curves with embedding degrees \(k=5,7\)
- Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction
This page was built for publication: Generating pairing-friendly elliptic curve parameters using sparse families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1640702)
