Pages that link to "Item:Q2832131"
From MaRDI portal
The following pages link to Guide to pairing-based cryptography (Q2832131):
Displaying 19 items.
- Generating pairing-friendly elliptic curve parameters using sparse families (Q1640702) (← links)
- Choosing and generating parameters for pairing implementation on BN curves (Q1745896) (← links)
- New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0 (Q1995209) (← links)
- Updating key size estimations for pairings (Q2010589) (← links)
- Indifferentiable hashing to ordinary elliptic \(\mathbb{F}_{q} \)-curves of \(j=0\) with the cost of one exponentiation in \(\mathbb{F}_{q} \) (Q2115746) (← links)
- Hashing to elliptic curves of \(j\)-invariant 1728 (Q2120982) (← links)
- Efficient hash maps to \(\mathbb{G}_2\) on BLS curves (Q2140834) (← links)
- LOVE a pairing (Q2146100) (← links)
- Hashing to elliptic curves of \(j=0\) and Mordell-Weil groups (Q2217273) (← links)
- TNFS resistant families of pairing-friendly elliptic curves (Q2333827) (← links)
- The most efficient indifferentiable hashing to elliptic curves of \(j\)-invariant 1728 (Q2680379) (← links)
- Tower building technique on elliptic curve with embedding degree 18 (Q2689396) (← links)
- Pairing-Based Cryptography (Q5050174) (← links)
- Optimal Encodings to Elliptic Curves of \(\boldsymbol{j}\)-Invariants 0, 1728 (Q5057037) (← links)
- Faster point compression for elliptic curves of $j$-invariant $0$ (Q5071488) (← links)
- Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists (Q6136710) (← links)
- New versions of Miller-loop secured against side-channel attacks (Q6169018) (← links)
- Hashing to elliptic curves through Cipolla-Lehmer-Müller's square root algorithm (Q6192060) (← links)
- Faster optimal ate pairings for cyclotomic sparse families of pairing-friendly elliptic curves with embedding degrees \(k=5,7\) (Q6637057) (← links)
