|
247
|
Efficient algorithms for pairing-based cryptosystems
– Paulo S. L. M. Barreto, Hae Y. Kim, Ben Lynn, Michael Scott
- 2002
|
|
104
|
Pairing-friendly elliptic curves of prime order
– Paulo S. L. M. Barreto, Michael Naehrig
- 2006
|
|
111
|
Efficient Pairing Computation on Supersingular Abelian Varieties
– Paulo S. L. M. Barreto, Steven Galbraith, Colm O Heigeartaigh, Michael Scott
- 2004
|
|
134
|
Implementing the Tate pairing
– S Galbraith, K Harrison, D Soldera
- 2002
|
|
852
|
Identity-Based Encryption from the Weil Pairing
– Dan Boneh, Matthew Franklin
- 2001
|
|
460
|
Short signatures from the Weil pairing
– Dan Boneh, Ben Lynn, Hovav Shacham
- 2001
|
|
77
|
Tate pairing implementation for hyperelliptic curves y2
– I Duursma, H-S Lee
- 2003
|
|
243
|
Reducing elliptic curve logarithms to logarithms in a finite field
– A Menezes, T Okamoto, S A Vanstone
- 1993
|
|
39
|
Elliptic Curves Suitable for Pairing Based Cryptography
– Friederike Brezing, Annegret Weng
- 2003
|
|
63
|
The Eta Pairing Revisited
– F. Hess, N. Smart, Frederik Vercauteren, Technische Universität Berlin
- 2006
|
|
24
|
High Security Pairing-Based Cryptography Revisited
– R. Granger, D. Page, N. P. Smart
- 2006
|
|
72
|
The Weil Pairing and its efficient calculation
– V S Miller
|
|
30
|
Compressed Pairings
– Michael Scott, Paulo S. L. M. Barreto
- 2004
|
|
84
|
New explicit conditions of elliptic curve traces for FR-reduction
– Atsuko Miyaji, Masaki Nakabayashi, Shunzou TAKANO
- 2001
|
|
220
|
A one round protocol for tripartite Diffie-Hellman
– A Joux
- 2000
|
|
71
|
Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
– Eric R. Verheul
- 2001
|
|
169
|
Hans-Georg Rück, A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves
– Gerhard Frey
- 1994
|
|
43
|
Constructing Elliptic Curves with Prescribed Embedding Degrees
– Paulo S.L.M. Barreto, Ben Lynn, Michael Scott
- 2002
|
|
78
|
The XTR public key system
– Arjen K. Lenstra, Eric R. Verheul
- 2000
|
