Pages that link to "Item:Q1772231"
From MaRDI portal
The following pages link to The Weil pairing, and its efficient calculation (Q1772231):
Displaying 41 items.
- Cryptographic Pairings Based on Elliptic Nets (Q3097999) (← links)
- Parallelizing the Weil and Tate Pairings (Q3104701) (← links)
- Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2 (Q3104703) (← links)
- Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings (Q3104750) (← links)
- Computing fixed argument pairings with the elliptic net algorithm (Q3121365) (← links)
- The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets (Q3121447) (← links)
- Computing isogenies between abelian varieties (Q3167320) (← links)
- CRT-Based Outsourcing Algorithms for Modular Exponentiations (Q3179478) (← links)
- Faster Pairings on Special Weierstrass Curves (Q3392905) (← links)
- Identity based group key agreement in multiple PKG environment (Q3443235) (← links)
- Idetity based group key agreement from bilinear pairing (Q3443280) (← links)
- Pairing Computation on Edwards Curves with High-Degree Twists (Q3454153) (← links)
- Efficient Implementation of Bilinear Pairings on ARM Processors (Q3455495) (← links)
- A Leakage Resilient MAC (Q3460113) (← links)
- Compact Group Signatures Without Random Oracles (Q3593110) (← links)
- Pairing Lattices (Q3600491) (← links)
- The Hidden Root Problem (Q3600495) (← links)
- Pairing Computation on Twisted Edwards Form Elliptic Curves (Q3600505) (← links)
- Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms (Q3600509) (← links)
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$ (Q3600512) (← links)
- What about Vulnerability to a Fault Attack of the Miller’s Algorithm During an Identity Based Protocol? (Q3634337) (← links)
- Pairing the volcano (Q4911917) (← links)
- Efficient Self-pairing on Ordinary Elliptic Curves (Q4922135) (← links)
- Elliptic curves in Huff’s model (Q4926885) (← links)
- Huff’s Model for Elliptic Curves (Q4931652) (← links)
- ON BOUNDS FOR BALANCED EMBEDDING DEGREE (Q5150737) (← links)
- Hensel-lifting torsion points on Jacobians and Galois representations (Q5216734) (← links)
- A Brief History of Pairings (Q5267789) (← links)
- Adequate Elliptic Curves for Computing the Product of n Pairings (Q5267791) (← links)
- Optimised Versions of the Ate and Twisted Ate Pairings (Q5448545) (← links)
- Explicit $n$-descent on elliptic curves III. Algorithms (Q5496219) (← links)
- Another Approach to Pairing Computation in Edwards Coordinates (Q5504639) (← links)
- Finding the group structure of elliptic curves over finite fields (Q5717395) (← links)
- Constraining Pseudorandom Functions Privately (Q5738766) (← links)
- Efficient Compression of SIDH Public Keys (Q5738894) (← links)
- Algebraic curves and cryptography (Q5921638) (← links)
- Quantum attribute-based encryption: a comprehensive study (Q6050246) (← links)
- Individual discrete logarithm with sublattice reduction (Q6070357) (← links)
- AN ANALYTIC PERSPECTIVE OF WEIL RECIPROCITY (Q6121736) (← links)
- Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists (Q6136710) (← links)
- A survey on functional encryption (Q6163797) (← links)
