Algorithms for pairing-friendly primes

DOI10.1007/978-3-319-04873-4_13MaRDI QIDQ5746232zbMATH OpenOpenAlexFDO

Authors Maciej Grześkowiak

Publication date 18 February 2014

Published in Pairing-Based Cryptography – Pairing 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-04873-4_13

zbMATH Keywords

embedding degreepairing-based cryptographypairing-friendly elliptic curves

Mathematics Subject Classification ID

Primality (11Y11) Cryptography (94A60)

Recommendations

• Pairing-Friendly Primes for Abelian Varieties
• Algorithms for relatively cyclotomic primes
• Elliptic curves suitable for pairing based cryptography
• Selected Areas in Cryptography
• An algorithmic construction of finite elliptic curves of order divisible by a large prime

Cited in

(7)

• Algorithms for relatively cyclotomic primes
• Algorithm for generating primes p and q such that q divides p^4 p^3 + p^2 p + 1
• Analysis of algorithms of generating key parameters for the XTR cryptosystems
• Pairing-Friendly Primes for Abelian Varieties
• scientific article; zbMATH DE number 962546 (Why is no real title available?)
• Constructing families of pairing-friendly elliptic curves with small -value and rational solutions of some systems of polynomial equations
• On chains of pairing-friendly elliptic curves

This page was built for publication: Algorithms for pairing-friendly primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746232)