Pages that link to "Item:Q1772224"
From MaRDI portal
The following pages link to Efficient implementation of pairing-based cryptosystems (Q1772224):
Displaying 16 items.
- Efficient \(p\)th root computations in finite fields of characteristic \(p\) (Q1009125) (← links)
- On the relationship between squared pairings and plain pairings (Q1045941) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- Parallelizing pairings on Hessian elliptic curves (Q1713870) (← links)
- LOVE a pairing (Q2146100) (← links)
- On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited (Q2275939) (← links)
- Efficient pairing computation on supersingular abelian varieties (Q2383998) (← links)
- Faster computation of the Tate pairing (Q2430985) (← links)
- Subgroup Security in Pairing-Based Cryptography (Q2946453) (← links)
- Elliptic curves with<i>j</i>= 0,1728 and low embedding degree (Q2958273) (← links)
- RNS arithmetic in 𝔽 pk and application to fast pairing computation (Q3015225) (← links)
- An Analysis of Affine Coordinates for Pairing Computation (Q3059636) (← links)
- On the Efficient Implementation of Pairing-Based Protocols (Q3104702) (← links)
- Faster Pairings on Special Weierstrass Curves (Q3392905) (← links)
- Huff’s Model for Elliptic Curves (Q4931652) (← links)
- Algebraic curves and cryptography (Q5921638) (← links)
