The following pages link to Optimal Pairings (Q4976063):
Displayed 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)
- 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)
- The pairing computation on Edwards curves (Q460158) (← links)
- Fixed argument pairing inversion on elliptic curves (Q499662) (← 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)
- Pattern matching on encrypted streams (Q1633445) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- Parallelizing pairings on Hessian elliptic curves (Q1713870) (← 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)
- Updating key size estimations for pairings (Q2010589) (← links)
- Hardware implementation of multiplication over quartic extension fields (Q2079983) (← links)
- LOVE a pairing (Q2146100) (← links)
- Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree (Q2163356) (← links)
- A survey on delegated computation (Q2163976) (← links)
- Families of SNARK-friendly 2-chains of elliptic curves (Q2170053) (← links)
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation (Q2182074) (← links)
- Secure and efficient delegation of elliptic-curve pairing (Q2229264) (← links)
- On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited (Q2275939) (← links)
- Beta Weil pairing revisited (Q2313463) (← links)
- Improving the computation of the optimal ate pairing for a high security level (Q2317387) (← links)
- Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves (Q2348162) (← links)
- Pairing inversion for finding discrete logarithms (Q2515203) (← links)
- Faster Hashing to ${\mathbb G}_2$ (Q2889888) (← links)
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves (Q2889998) (← links)
- Subgroup Security in Pairing-Based Cryptography (Q2946453) (← links)
- Higher-Order Side Channel Security and Mask Refreshing (Q2946888) (← links)
- Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography (Q2947089) (← 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)
- 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)
- An experiment of number field sieve for discrete logarithm problem over $\text{GF}(p^n)$ (Q3121357) (← 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)
- Pairing Computation on Edwards Curves with High-Degree Twists (Q3454153) (← links)
- Efficient Implementation of Bilinear Pairings on ARM Processors (Q3455495) (← links)
- Efficient Self-pairing on Ordinary Elliptic Curves (Q4922135) (← links)
- Pairing-Based Cryptography (Q5050174) (← links)
- A survey of elliptic curves for proof systems (Q6063127) (← links)