Pages that link to "Item:Q2383998"
From MaRDI portal
The following pages link to Efficient pairing computation on supersingular abelian varieties (Q2383998):
Displaying 50 items.
- Faster Ate pairing computation on Selmer's model of elliptic curves (Q285904) (← links)
- Further refinements of Miller's algorithm on Edwards curves (Q300877) (← links)
- Zero-knowledge proofs of retrievability (Q350924) (← links)
- Complexity of computation in finite fields (Q378003) (← links)
- Self-pairings on supersingular elliptic curves with embedding degree \textit{three} (Q402545) (← links)
- Optimal pairing computation over families of pairing-friendly elliptic curves (Q429764) (← links)
- Efficient algorithms for secure outsourcing of bilinear pairings (Q476851) (← links)
- An efficient ring signature scheme from pairings (Q528720) (← links)
- Computing bilinear pairings on elliptic curves with automorphisms (Q629880) (← links)
- An enhanced \((t,n)\) threshold directed signature scheme (Q726561) (← links)
- A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties (Q741253) (← links)
- Polynomial generating pairing and its criterion for optimal pairing (Q744018) (← links)
- A survey of fault attacks in pairing based cryptography (Q892296) (← links)
- Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\) (Q932799) (← links)
- Efficient Tate pairing computation using double-base chains (Q954437) (← links)
- Comparing two pairing-based aggregate signature schemes (Q970534) (← links)
- Pairings for cryptographers (Q1003698) (← links)
- Computing pairings using \(x\)-coordinates only (Q1009121) (← links)
- Using abelian varieties to improve pairing-based cryptography (Q1027984) (← links)
- On the relationship between squared pairings and plain pairings (Q1045941) (← links)
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields (Q1620973) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- Choosing and generating parameters for pairing implementation on BN curves (Q1745896) (← links)
- Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves (Q1943983) (← links)
- Faster pairing computation on genus \(2\) hyperelliptic curves (Q1944931) (← links)
- Efficient hash maps to \(\mathbb{G}_2\) on BLS curves (Q2140834) (← links)
- A taxonomy of pairing-friendly elliptic curves (Q2267367) (← links)
- Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves (Q2348162) (← links)
- Short signatures without random oracles and the SDH assumption in bilinear groups (Q2425530) (← links)
- Formulas for cube roots in \(\mathbb F_{3^m}\) using shifted polynomial basis (Q2446580) (← links)
- On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings (Q2453385) (← links)
- Ordinary Abelian varieties having small embedding degree (Q2467316) (← links)
- A Digital Signature Scheme Based on Two Hard Problems (Q2790443) (← links)
- Faster Hashing to ${\mathbb G}_2$ (Q2889888) (← links)
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves (Q2889998) (← links)
- An Analysis of Affine Coordinates for Pairing Computation (Q3059636) (← links)
- Cryptographic Pairings Based on Elliptic Nets (Q3097999) (← links)
- Parallelizing the Weil and Tate Pairings (Q3104701) (← links)
- On the Efficient Implementation of Pairing-Based Protocols (Q3104702) (← links)
- Computing fixed argument pairings with the elliptic net algorithm (Q3121365) (← links)
- Faster Pairings on Special Weierstrass Curves (Q3392905) (← links)
- Forward-Secure Group Signatures from Pairings (Q3392911) (← links)
- Cryptanalysis of Pairing-Based Cryptosystems Over Small Characteristic Fields (Q3455007) (← links)
- Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\mathbb{F}_{2^{1223}}$ (Q3455496) (← links)
- On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6 (Q3502730) (← links)
- On Compressible Pairings and Their Computation (Q3506394) (← links)
- Pairing Lattices (Q3600491) (← links)
- The Hidden Root Problem (Q3600495) (← links)
- Exponentiation in Pairing-Friendly Groups Using Homomorphisms (Q3600506) (← links)
- Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms (Q3600509) (← links)
