Elliptic curves suitable for pairing based cryptography

DOI10.1007/s10623-004-3808-4zbMath1100.14517OpenAlexW1992402139MaRDI QIDQ2572982

Publication date: 7 November 2005

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-004-3808-4

zbMATH Keywords

elliptic curves pairing based cryptography

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Finite ground fields in algebraic geometry (14G15) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (43)

Pairing-based cryptography on elliptic curves ⋮ Efficient hash maps to \(\mathbb{G}_2\) on BLS curves ⋮ Generating pairing-friendly elliptic curve parameters using sparse families ⋮ Minimal degrees of algebraic numbers with respect to primitive elements ⋮ Heuristics on pairing-friendly abelian varieties ⋮ Extended Explicit Relations Between Trace, Definition Field, and Embedding Degree ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Shorter identity-based encryption via asymmetric pairings ⋮ Unbounded predicate inner product functional encryption from pairings ⋮ Elliptic curves withj= 0,1728 and low embedding degree ⋮ Reinforcing privacy in cloud computing via adaptively secure non-zero inner product encryption and anonymous identity-based revocation in unbounded setting ⋮ Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves ⋮ Solving discrete logarithms on a 170-bit MNT curve by pairing reduction ⋮ Finding composite order ordinary elliptic curves using the Cocks-Pinch method ⋮ Constructing pairing-friendly hyperelliptic curves using Weil restriction ⋮ Optimal pairing computation over families of pairing-friendly elliptic curves ⋮ Ordinary Abelian varieties having small embedding degree ⋮ RNS arithmetic in 𝔽 pk and application to fast pairing computation ⋮ An efficient ring signature scheme from pairings ⋮ Algebraic curves and cryptography ⋮ On Cycles of Pairing-Friendly Elliptic Curves ⋮ Provably secure non-interactive key distribution based on pairings ⋮ Generating more MNT elliptic curves ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field ⋮ Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials ⋮ Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax ⋮ The complexity of class polynomial computation via floating point approximations ⋮ A New Method for Constructing Pairing-Friendly Abelian Surfaces ⋮ Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction ⋮ Polynomial generating pairing and its criterion for optimal pairing ⋮ A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level ⋮ Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography ⋮ Generating Pairing-Friendly Curves with the CM Equation of Degree 1 ⋮ On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves ⋮ Faster Pairings on Special Weierstrass Curves ⋮ On the Efficient Implementation of Pairing-Based Protocols ⋮ On Constructing Families of Pairing-Friendly Elliptic Curves with Variable Discriminant ⋮ Note on families of pairing-friendly elliptic curves with small embedding degree ⋮ More Discriminants with the Brezing-Weng Method ⋮ Another Approach to Pairing Computation in Edwards Coordinates ⋮ TNFS resistant families of pairing-friendly elliptic curves ⋮ Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves

Cites Work

This page was built for publication: Elliptic curves suitable for pairing based cryptography