Pages that link to "Item:Q5443538"
From MaRDI portal
The following pages link to Simplified pairing computation and security implications (Q5443538):
Displaying 6 items.
- The Diffie-Hellman problem and generalization of Verheul's theorem (Q735041) (← links)
- Closed formulae for the Weil pairing inversion (Q938771) (← links)
- Polynomial approximation of bilinear Diffie-Hellman maps (Q2426464) (← links)
- Pairings in Trusted Computing (Q3600490) (← links)
- EFFICIENT PAIRING FUNCTIONS — AND WHY YOU SHOULD CARE (Q5696889) (← links)
- Secure and Efficient Pairing at 256-Bit Security Level (Q6487201) (← links)