The following pages link to Information Security and Privacy (Q5473532):
Displaying 11 items.
- Efficient computation of pairings on Jacobi quartic elliptic curves (Q490338) (← links)
- An optimal Tate pairing computation using Jacobi quartic elliptic curves (Q1752615) (← links)
- Efficient pairing computation on supersingular abelian varieties (Q2383998) (← links)
- Faster computation of the Tate pairing (Q2430985) (← links)
- Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2 (Q3104703) (← links)
- Efficient Algorithm for Tate Pairing of Composite Order (Q3190025) (← links)
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$ (Q3600512) (← links)
- On Software Parallel Implementation of Cryptographic Pairings (Q3644191) (← links)
- (Q4418548) (← links)
- A SAT-Based Approach for Index Calculus on Binary Elliptic Curves (Q5048971) (← links)
- Fast Architectures for the \eta_T Pairing over Small-Characteristic Supersingular Elliptic Curves (Q5280637) (← links)
