Pages that link to "Item:Q2383998"
From MaRDI portal
The following pages link to Efficient pairing computation on supersingular abelian varieties (Q2383998):
Displayed 9 items.
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$ (Q3600512) (← links)
- Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates (Q3644190) (← links)
- On Software Parallel Implementation of Cryptographic Pairings (Q3644191) (← links)
- Recovering RSA Secret Keys from Noisy Key Bits with Erasures and Errors (Q4916008) (← links)
- Pairing-Based Cryptography (Q5050174) (← links)
- Simplified pairing computation and security implications (Q5443538) (← links)
- Optimised Versions of the Ate and Twisted Ate Pairings (Q5448545) (← links)
- Another Look at Square Roots (and Other Less Common Operations) in Fields of Even Characteristic (Q5452253) (← links)
- Efficient Compression of SIDH Public Keys (Q5738894) (← links)