S.D. Galbraith, K. Harrison, and D. Soldera. Implementing the Tate pairing. Algorithm Number Theory Symposium - ANTS V, LNCS 2369, pp. 324-337. SpringerVerlag, 2002. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On the Selection of Pairing-Friendly Groups - Barreto, Lynn, Scott (2003) (10 citations) (Correct)
....embedding degree k, we investigate the problem of finding suitable points P E(Fq ) of order r and Q E(F q k) linearly independent from P , such that the restricted Tate pairing e : #P # #Q# # F k is e#ciently computable. E#cient algorithms for supersingular curves have been proposed [1, 8, 11]. However, there is a widespread feeling that supersingular curves should be avoided whenever possible, as they may be more susceptible to attacks than ordinary curves. Additionally, choices of k are very limited for supersingular curves, and the larger values only occur over fields of small ....
S. Galbraith, K. Harrison, and D. Soldera, Implementing the Tate pairing, Algorithm Number Theory Symposium -- ANTS V, Lecture Notes in Computer Science, vol. 2369, Springer-Verlag, 2002, pp. 324--337.
Efficient Tate Pairing Computation Using Double-Base Chains - Zhao, Zhang, Huang (2006) Self-citation (Tate) (Correct)
No context found.
S.D. Galbraith, K. Harrison, and D. Soldera. Implementing the Tate pairing. Algorithm Number Theory Symposium - ANTS V, LNCS 2369, pp. 324-337. SpringerVerlag, 2002.
Dynamic Group Key Agreement in Tree-Based Setting - Dutta, Barua (2005) (Correct)
No context found.
S. Galbraith, K. Harrison and D. Soldera. Implementing the Tate Pairing, Algorithm Number Theory Symposium - ANTS V, LNCS 2369, Springer- Verlag (2002), pp. 324-337.
Constant Round Dynamic Group Key Agreement - Dutta, Barua (2005) (Correct)
No context found.
S. Galbraith, K. Harrison and D. Soldera. Implementing the Tate Pairing, Algorithm Number Theory Symposium - ANTS V, LNCS 2369, Springer- Verlag (2002), pp. 324-337.
Provably Secure Authenticated Tree Based Group Key.. - Barua, Dutta, Sarkar (2004) (Correct)
No context found.
S. Galbraith, K. Harrison and D. Soldera. Implementing the Tate Pairing. Algorithm Number Theory Symposium - ANTS V, LNCS 2369, Springer- Verlag (2002), pp. 324-337.
On the Selection of Pairing-Friendly Groups - Barreto, Lynn, Scott (2003) (10 citations) (Correct)
No context found.
S. Galbraith, K. Harrison, and D. Soldera, Implementing the Tate pairing, Algorithm Number Theory Symposium -- ANTS V, Lecture Notes in Computer Science, vol. 2369, Springer-Verlag, 2002, pp. 324--337.
Pairing-Based Cryptographic Protocols: A Survey - Dutta, Barua, Sarkar (2004) (6 citations) (Correct)
No context found.
S. Galbraith, K. Harrison and D. Soldera. Implementing the Tate Pairing. Algorithm Number Theory Symposium - ANTS V, LNCS 2369, Springer- Verlag (2002), pp. 324-337.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC