Pages that link to "Item:Q3600498"

The following pages link to Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field (Q3600498):

Displaying 39 items.

• Low-cost addition-subtraction sequences for the final exponentiation in pairings (Q740296) (← links)
• Polynomial generating pairing and its criterion for optimal pairing (Q744018) (← links)
• Generating pairing-friendly elliptic curve parameters using sparse families (Q1640702) (← links)
• Updating key size estimations for pairings (Q2010589) (← links)
• Hardware implementation of multiplication over quartic extension fields (Q2079983) (← links)
• Hashing to elliptic curves of \(j\)-invariant 1728 (Q2120982) (← links)
• Efficient hash maps to \(\mathbb{G}_2\) on BLS curves (Q2140834) (← links)
• A survey on delegated computation (Q2163976) (← links)
• Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions (Q2210433) (← links)
• Secure and efficient delegation of elliptic-curve pairing (Q2229264) (← links)
• A taxonomy of pairing-friendly elliptic curves (Q2267367) (← links)
• Improving the computation of the optimal ate pairing for a high security level (Q2317387) (← links)
• TNFS resistant families of pairing-friendly elliptic curves (Q2333827) (← links)
• Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves (Q2348162) (← links)
• Tower building technique on elliptic curve with embedding degree 18 (Q2689396) (← links)
• Faster Hashing to ${\mathbb G}_2$ (Q2889888) (← links)
• Subgroup Security in Pairing-Based Cryptography (Q2946453) (← links)
• An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication (Q2988347) (← links)
• Computing Hilbert class polynomials with the Chinese remainder theorem (Q3081296) (← links)
• On the Efficient Implementation of Pairing-Based Protocols (Q3104702) (← links)
• On Constructing Families of Pairing-Friendly Elliptic Curves with Variable Discriminant (Q3104749) (← links)
• Heuristic counting of Kachisa-Schaefer-Scott curves (Q3121368) (← links)
• Note on families of pairing-friendly elliptic curves with small embedding degree (Q3121464) (← links)
• Generating Pairing-Friendly Curves with the CM Equation of Degree 1 (Q3392903) (← links)
• On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves (Q3392904) (← links)
• Faster Pairings on Special Weierstrass Curves (Q3392905) (← links)
• Fast Hashing to G 2 on Pairing-Friendly Curves (Q3392906) (← links)
• On Compressible Pairings and Their Computation (Q3506394) (← links)
• Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials (Q3600499) (← links)
• Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography (Q3634510) (← links)
• Minimal degrees of algebraic numbers with respect to primitive elements (Q5069075) (← links)
• Adequate Elliptic Curves for Computing the Product of n Pairings (Q5267791) (← links)
• On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves (Q5389447) (← links)
• Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree (Q5738795) (← links)
• On Cycles of Pairing-Friendly Elliptic Curves (Q5742695) (← links)
• A survey of elliptic curves for proof systems (Q6063127) (← links)
• Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves (Q6074017) (← links)
• Vector commitments with proofs of smallness: short range proofs and more (Q6635763) (← links)
• Families of prime-order endomorphism-equipped embedded curves on pairing-friendly curves (Q6639501) (← links)