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.
- Effective compression maps for torus-based cryptography (Q264119) (← links)
- Faster Ate pairing computation on Selmer's model of elliptic curves (Q285904) (← links)
- Self-pairings on supersingular elliptic curves with embedding degree \textit{three} (Q402545) (← links)
- Shorter identity-based encryption via asymmetric pairings (Q404944) (← links)
- Optimal pairing computation over families of pairing-friendly elliptic curves (Q429764) (← links)
- Maximum gap in (inverse) cyclotomic polynomial (Q448219) (← links)
- On the elliptic curves \(y^{2}=x^{3} - c\) with embedding degree one (Q555157) (← links)
- Efficient selective identity-based encryption without random oracles (Q656924) (← links)
- Low-cost addition-subtraction sequences for the final exponentiation in pairings (Q740296) (← links)
- Polynomial generating pairing and its criterion for optimal pairing (Q744018) (← links)
- Implementing optimized pairings with elliptic nets (Q893619) (← links)
- On the embedding degree of reductions of an elliptic curve (Q989443) (← links)
- Pairings for cryptographers (Q1003698) (← links)
- Expander graphs based on GRH with an application to elliptic curve cryptography (Q1019852) (← links)
- Pairing-based cryptography on elliptic curves (Q1616164) (← links)
- Generating pairing-friendly elliptic curve parameters using sparse families (Q1640702) (← links)
- Factor base discrete logarithms in Kummer extensions (Q1654504) (← 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)
- On the elliptic curve endomorphism generator (Q1744020) (← links)
- Computing discrete logarithms in \(\mathbb F_{p^6}\) (Q1746956) (← links)
- An optimal Tate pairing computation using Jacobi quartic elliptic curves (Q1752615) (← links)
- Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves (Q1943983) (← links)
- Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields (Q1949237) (← links)
- Maximum gap in cyclotomic polynomials (Q1981578) (← links)
- New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0 (Q1995209) (← links)
- Updating key size estimations for pairings (Q2010589) (← links)
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography (Q2055643) (← links)
- A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level (Q2055706) (← links)
- Hardware implementation of multiplication over quartic extension fields (Q2079983) (← links)
- Efficient hash maps to \(\mathbb{G}_2\) on BLS curves (Q2140834) (← links)
- LOVE a pairing (Q2146100) (← links)
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption (Q2152147) (← links)
- Families of SNARK-friendly 2-chains of elliptic curves (Q2170053) (← links)
- On the multi-user security of short Schnorr signatures with preprocessing (Q2170064) (← links)
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation (Q2182074) (← links)
- Beta Weil pairing revisited (Q2313463) (← links)
- TNFS resistant families of pairing-friendly elliptic curves (Q2333827) (← links)
- Still wrong use of pairings in cryptography (Q2335138) (← links)
- Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves (Q2348162) (← links)
- Compact proofs of retrievability (Q2392096) (← links)
- Finding composite order ordinary elliptic curves using the Cocks-Pinch method (Q2430983) (← links)
- Faster computation of the Tate pairing (Q2430985) (← links)
- Constructing pairing-friendly hyperelliptic curves using Weil restriction (Q2430992) (← links)
- Heuristics of the Cocks-Pinch method (Q2437964) (← links)
- Cryptography on twisted Edwards curves over local fields (Q2515455) (← links)
- On the near prime-order MNT curves (Q2631924) (← links)
- 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)
