Pages that link to "Item:Q2267367"
From MaRDI portal
The following pages link to A taxonomy of pairing-friendly elliptic curves (Q2267367):
Displaying 50 items.
- Schinzel hypothesis on average and rational points (Q2689273) (← links)
- Point Decomposition Problem in Binary Elliptic Curves (Q2806768) (← links)
- Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case (Q2835600) (← links)
- Generalised Weber functions (Q2875425) (← links)
- Faster Hashing to ${\mathbb G}_2$ (Q2889888) (← links)
- Heuristics on pairing-friendly abelian varieties (Q2942134) (← links)
- Subgroup Security in Pairing-Based Cryptography (Q2946453) (← links)
- Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography (Q2947089) (← links)
- On Near Prime-Order Elliptic Curves with Small Embedding Degrees (Q2947154) (← links)
- Elliptic curves with<i>j</i>= 0,1728 and low embedding degree (Q2958273) (← links)
- Collecting relations for the number field sieve in (Q2971019) (← links)
- On Constructing Parameterized Families of Pairing-Friendly Elliptic Curves with $$\rho =1$$ (Q2980869) (← links)
- An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication (Q2988347) (← links)
- Efficient Multiplication in Finite Field Extensions of Degree 5 (Q3011913) (← links)
- RNS arithmetic in 𝔽 pk and application to fast pairing computation (Q3015225) (← links)
- An Analysis of Affine Coordinates for Pairing Computation (Q3059636) (← links)
- A New Method for Constructing Pairing-Friendly Abelian Surfaces (Q3059658) (← links)
- Computing Hilbert class polynomials with the Chinese remainder theorem (Q3081296) (← links)
- On the Efficient Implementation of Pairing-Based Protocols (Q3104702) (← links)
- Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2 (Q3104703) (← links)
- On Constructing Families of Pairing-Friendly Elliptic Curves with Variable Discriminant (Q3104749) (← links)
- Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings (Q3104750) (← links)
- Efficient system parameters for Identity-Based Encryption using supersingular elliptic curves (Q3121344) (← links)
- Heuristic counting of Kachisa-Schaefer-Scott curves (Q3121368) (← links)
- Note on families of pairing-friendly elliptic curves with small embedding degree (Q3121464) (← links)
- On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields (Q3392902) (← 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)
- Compact E-Cash and Simulatable VRFs Revisited (Q3392907) (← links)
- Pairing Computation on Edwards Curves with High-Degree Twists (Q3454153) (← links)
- On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6 (Q3502730) (← links)
- On Compressible Pairings and Their Computation (Q3506394) (← links)
- Compact Proofs of Retrievability (Q3600367) (← 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)
- Integer Variable χ–Based Ate Pairing (Q3600504) (← links)
- Pairing Computation on Twisted Edwards Form Elliptic Curves (Q3600505) (← links)
- Exponentiation in Pairing-Friendly Groups Using Homomorphisms (Q3600506) (← links)
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme (Q3627448) (← links)
- Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography (Q3634510) (← links)
- Heuristics on pairing-friendly elliptic curves (Q4650074) (← links)
- On the Computation of Class Polynomials with “Thetanullwerte” and Its Applications to the Unit Group Computation (Q4915390) (← links)
- A Subexponential Algorithm for Evaluating Large Degree Isogenies (Q4931651) (← links)
- Minimal degrees of algebraic numbers with respect to primitive elements (Q5069075) (← links)
- ON BOUNDS FOR BALANCED EMBEDDING DEGREE (Q5150737) (← links)
- A Brief History of Pairings (Q5267789) (← links)
- On Instantiating Pairing-Based Protocols with Elliptic Curves of Embedding Degree One (Q5353467) (← links)
