Pages that link to "Item:Q4975817"
From MaRDI portal
The following pages link to Efficient and Generalized Pairing Computation on Abelian Varieties (Q4975817):
Displaying 25 items.
- 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)
- Maximum gap in (inverse) cyclotomic polynomial (Q448219) (← links)
- Fixed argument pairing inversion on elliptic curves (Q499662) (← links)
- Computing bilinear pairings on elliptic curves with automorphisms (Q629880) (← links)
- Polynomial generating pairing and its criterion for optimal pairing (Q744018) (← links)
- Comparing two pairing-based aggregate signature schemes (Q970534) (← 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)
- Maximum gap in cyclotomic polynomials (Q1981578) (← links)
- On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited (Q2275939) (← links)
- Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves (Q2348162) (← links)
- Faster Hashing to ${\mathbb G}_2$ (Q2889888) (← links)
- An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication (Q2988347) (← links)
- RNS arithmetic in 𝔽 pk and application to fast pairing computation (Q3015225) (← 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)
- Generating Pairing-Friendly Curves with the CM Equation of Degree 1 (Q3392903) (← links)
- On Compressible Pairings and Their Computation (Q3506394) (← links)
- Integer Variable χ–Based Ate Pairing (Q3600504) (← links)
- Efficient Self-pairing on Ordinary Elliptic Curves (Q4922135) (← links)
