The following pages link to Algorithmic Number Theory (Q5899270):
Displaying 18 items.
- Memory-saving computation of the pairing final exponentiation on BN curves (Q285907) (← links)
- Efficient implementation of pairing-based cryptosystems (Q1772224) (← links)
- A taxonomy of pairing-friendly elliptic curves (Q2267367) (← links)
- Beta Weil pairing revisited (Q2313463) (← links)
- Improving the computation of the optimal ate pairing for a high security level (Q2317387) (← links)
- Point Decomposition Problem in Binary Elliptic Curves (Q2806768) (← links)
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves (Q2889998) (← links)
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves (Q3392904) (← links)
- Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition (Q3600511) (← links)
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$ (Q3600512) (← links)
- A Schnorr-Like Lightweight Identity-Based Signature Scheme (Q3637136) (← links)
- On Software Parallel Implementation of Cryptographic Pairings (Q3644191) (← links)
- Finding Invalid Signatures in Pairing-Based Batches (Q5447507) (← links)
- Another Approach to Pairing Computation in Edwards Coordinates (Q5504639) (← links)
- Selected Areas in Cryptography (Q5713963) (← links)
- Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves (Q6074017) (← links)
- Compact structure-preserving signatures with almost tight security (Q6134421) (← links)
- Secure and Efficient Pairing at 256-Bit Security Level (Q6487201) (← links)
