Pages that link to "Item:Q2383998"
From MaRDI portal
The following pages link to Efficient pairing computation on supersingular abelian varieties (Q2383998):
Displayed 44 items.
- 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)
- Computing bilinear pairings on elliptic curves with automorphisms (Q629880) (← 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)
- 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)
- 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)
- A taxonomy of pairing-friendly elliptic curves (Q2267367) (← 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)
- 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)
- Faster Pairings on Special Weierstrass Curves (Q3392905) (← links)
- Forward-Secure Group Signatures from Pairings (Q3392911) (← 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)
- Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition (Q3600511) (← links)
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$ (Q3600512) (← links)
- Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates (Q3644190) (← links)
- On Software Parallel Implementation of Cryptographic Pairings (Q3644191) (← links)
- Recovering RSA Secret Keys from Noisy Key Bits with Erasures and Errors (Q4916008) (← links)
- Simplified pairing computation and security implications (Q5443538) (← links)
- Optimised Versions of the Ate and Twisted Ate Pairings (Q5448545) (← links)
- Another Look at Square Roots (and Other Less Common Operations) in Fields of Even Characteristic (Q5452253) (← links)