Pages that link to "Item:Q2572982"

The following pages link to Elliptic curves suitable for pairing based cryptography (Q2572982):

Displaying 43 items.

• Shorter identity-based encryption via asymmetric pairings (Q404944) (← links)
• Optimal pairing computation over families of pairing-friendly elliptic curves (Q429764) (← links)
• An efficient ring signature scheme from pairings (Q528720) (← links)
• Polynomial generating pairing and its criterion for optimal pairing (Q744018) (← links)
• Pairing-based cryptography on elliptic curves (Q1616164) (← links)
• Generating pairing-friendly elliptic curve parameters using sparse families (Q1640702) (← links)
• Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
• Solving discrete logarithms on a 170-bit MNT curve by pairing reduction (Q1698673) (← links)
• Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves (Q1943983) (← links)
• A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level (Q2055706) (← links)
• Efficient hash maps to \(\mathbb{G}_2\) on BLS curves (Q2140834) (← links)
• A taxonomy of pairing-friendly elliptic curves (Q2267367) (← 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)
• Finding composite order ordinary elliptic curves using the Cocks-Pinch method (Q2430983) (← links)
• Constructing pairing-friendly hyperelliptic curves using Weil restriction (Q2430992) (← links)
• Ordinary Abelian varieties having small embedding degree (Q2467316) (← links)
• Provably secure non-interactive key distribution based on pairings (Q2489921) (← links)
• Generating more MNT elliptic curves (Q2491266) (← links)
• Heuristics on pairing-friendly abelian varieties (Q2942134) (← links)
• Extended Explicit Relations Between Trace, Definition Field, and Embedding Degree (Q2947157) (← links)
• Elliptic curves with<i>j</i>= 0,1728 and low embedding degree (Q2958273) (← links)
• RNS arithmetic in 𝔽 pk and application to fast pairing computation (Q3015225) (← links)
• The complexity of class polynomial computation via floating point approximations (Q3055132) (← links)
• A New Method for Constructing Pairing-Friendly Abelian Surfaces (Q3059658) (← links)
• On the Efficient Implementation of Pairing-Based Protocols (Q3104702) (← links)
• On Constructing Families of Pairing-Friendly Elliptic Curves with Variable Discriminant (Q3104749) (← 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)
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field (Q3600498) (← links)
• Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials (Q3600499) (← links)
• Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax (Q3600501) (← 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)
• Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction (Q5448547) (← links)
• More Discriminants with the Brezing-Weng Method (Q5504638) (← links)
• Another Approach to Pairing Computation in Edwards Coordinates (Q5504639) (← links)
• On Cycles of Pairing-Friendly Elliptic Curves (Q5742695) (← links)
• Algebraic curves and cryptography (Q5921638) (← links)
• Unbounded predicate inner product functional encryption from pairings (Q6109084) (← links)
• Reinforcing privacy in cloud computing via adaptively secure non-zero inner product encryption and anonymous identity-based revocation in unbounded setting (Q6124593) (← links)