-
1
-
-
33847698965
-
Efficient pairing computation on supersingular abelian varieties
-
Barreto, P.S.L.M., Galbraith, S., O'hEigeartaigh, C., Scott, M.: Efficient pairing computation on supersingular abelian varieties. Designs, Codes and Cryptography 42(3), 239-271 (2007)
-
(2007)
Designs, Codes and Cryptography
, vol.42
, Issue.3
, pp. 239-271
-
-
Barreto, P.S.L.M.1
Galbraith, S.2
O'hEigeartaigh, C.3
Scott, M.4
-
2
-
-
33846452379
-
The Eta Pairing Revisited
-
Hess, F., Smart, N.P., Vercauteren, F.: The Eta Pairing Revisited. IEEE Transaction on Information Theory 52(10), 4595-4602 (2006)
-
(2006)
IEEE Transaction on Information Theory
, vol.52
, Issue.10
, pp. 4595-4602
-
-
Hess, F.1
Smart, N.P.2
Vercauteren, F.3
-
3
-
-
52149100203
-
-
Lang, S.: Algebra. GTM 211. Springer, Heidelberg (2002)
-
Lang, S.: Algebra. GTM 211. Springer, Heidelberg (2002)
-
-
-
-
4
-
-
45449085341
-
Efficient and Generalized Pairing Computation on Abelian Varieties, Cryptology ePrint Archive
-
Report 2008/040
-
Lee, E., Lee, H.-S., Park, C.-M.: Efficient and Generalized Pairing Computation on Abelian Varieties, Cryptology ePrint Archive, Report 2008/040 (2008), http://eprint.iacr.org/2008/0040
-
(2008)
-
-
Lee, E.1
Lee, H.-S.2
Park, C.-M.3
-
5
-
-
38349033352
-
Optimised Versions of the Ate and Twisted Ate Pairings
-
Galbraith, S.D, ed, Cryptography and Coding 2007, Springer, Heidelberg
-
Matsuda, S., Kanayama, N., Hess, F., Okamoto, E.: Optimised Versions of the Ate and Twisted Ate Pairings. In: Galbraith, S.D. (ed.) Cryptography and Coding 2007. LNCS, vol. 4887, pp. 302-312. Springer, Heidelberg (2007)
-
(2007)
LNCS
, vol.4887
, pp. 302-312
-
-
Matsuda, S.1
Kanayama, N.2
Hess, F.3
Okamoto, E.4
-
6
-
-
22144445920
-
The Weil pairing, and its efficient calculation
-
Miller, V.S.: The Weil pairing, and its efficient calculation. J. Cryptology 17(4), 235-261 (2004)
-
(2004)
J. Cryptology
, vol.17
, Issue.4
, pp. 235-261
-
-
Miller, V.S.1
-
7
-
-
84947751619
-
-
Paulus, S.: Lattice basis reduction in function fields. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, 1423, pp. 567-575. Springer, Heidelberg (1998)
-
Paulus, S.: Lattice basis reduction in function fields. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 567-575. Springer, Heidelberg (1998)
-
-
-
-
8
-
-
33646843808
-
Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism
-
Maitra, S, Veni Madhavan, C.E, Venkatesan, R, eds, INDOCRYPT 2005, Springer, Heidelberg
-
Scott, M.: Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism. In: Maitra, S., Veni Madhavan, C.E., Venkatesan, R. (eds.) INDOCRYPT 2005. LNCS, vol. 3797, pp. 258-269. Springer, Heidelberg (2005)
-
(2005)
LNCS
, vol.3797
, pp. 258-269
-
-
Scott, M.1
-
9
-
-
52149099532
-
-
Vercauteren, F.: Optimal Pairings, Cryptology ePrint Archive, Report, 2008/096 (2008), http://eprint.iacr.org/2008/096
-
Vercauteren, F.: Optimal Pairings, Cryptology ePrint Archive, Report, 2008/096 (2008), http://eprint.iacr.org/2008/096
-
-
-
-
10
-
-
71949084487
-
A Note on the Ate Pairing, Cryptology ePrint Archive
-
Report 2007/247
-
Zhao, C.-A., Zhang, F., Huang, J.: A Note on the Ate Pairing, Cryptology ePrint Archive, Report 2007/247 (2007), http://eprint.iacr.org/2007/247
-
(2007)
-
-
Zhao, C.-A.1
Zhang, F.2
Huang, J.3
-
11
-
-
52149119508
-
Reducing the Complexity of the Weil Pairing Computation, Cryptology ePrint Archive
-
Report 2008/212
-
Zhao, C.-A., Zhang, F.: Reducing the Complexity of the Weil Pairing Computation, Cryptology ePrint Archive, Report 2008/212 (2008), http://eprint.iacr.org/2008/212
-
(2008)
-
-
Zhao, C.-A.1
Zhang, F.2
|