Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field

DOI10.1007/978-3-540-85538-5_9zbMath1186.94451OpenAlexW1520251037MaRDI QIDQ3600498

No author found.

Publication date: 10 February 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-85538-5_9

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (42)

Hashing to elliptic curves of $j$-invariant 1728 ⋮ Faster Hashing to ${\mathbb G}_2$ ⋮ 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 ⋮ A survey on delegated computation ⋮ Subgroup Security in Pairing-Based Cryptography ⋮ A survey of elliptic curves for proof systems ⋮ Fast subgroup membership testings for $\mathbb{G}_1, \mathbb{G}_2$ and $\mathbb{G}_T$ on pairing-friendly curves ⋮ GLUE: generalizing unbounded attribute-based encryption for flexible efficiency trade-offs ⋮ On Compressible Pairings and Their Computation ⋮ Tower building technique on elliptic curve with embedding degree 18 ⋮ Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions ⋮ An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication ⋮ On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves ⋮ Secure and efficient delegation of elliptic-curve pairing ⋮ Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree ⋮ On Cycles of Pairing-Friendly Elliptic Curves ⋮ Updating key size estimations for pairings ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ Secure and Efficient Pairing at 256-Bit Security Level ⋮ Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials ⋮ Curves with Fast Computations in the First Pairing Group ⋮ Low-cost addition-subtraction sequences for the final exponentiation in pairings ⋮ Vector commitments with proofs of smallness: short range proofs and more ⋮ Families of prime-order endomorphism-equipped embedded curves on pairing-friendly curves ⋮ Polynomial generating pairing and its criterion for optimal pairing ⋮ Computing Hilbert class polynomials with the Chinese remainder theorem ⋮ 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 ⋮ Fast Hashing to G 2 on Pairing-Friendly Curves ⋮ Improving the computation of the optimal ate pairing for a high security level ⋮ On the Efficient Implementation of Pairing-Based Protocols ⋮ On Constructing Families of Pairing-Friendly Elliptic Curves with Variable Discriminant ⋮ Hardware implementation of multiplication over quartic extension fields ⋮ Heuristic counting of Kachisa-Schaefer-Scott curves ⋮ Note on families of pairing-friendly elliptic curves with small embedding degree ⋮ TNFS resistant families of pairing-friendly elliptic curves ⋮ Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves ⋮ Adequate Elliptic Curves for Computing the Product of n Pairings

Cites Work

This page was built for publication: Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field