Another approach to pairing computation in edwards coordinates

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5365 LNCS, Issue , 2008, Pages 400-413

  Ionica, Sorina ^b   Joux, Antoine ^a,b  

^a Delegation Generale pour l'Armement   (France)

^b LABORATOIRE DES SCIENCES DU CLIMAT ET DE L ENVIRONNEMENT   (France)

Author keywords

Edwards coordinates; Miller's algorithm; Tate pairing

Indexed keywords

CURVE CRYPTOGRAPHY; EDWARDS COORDINATES; JACOBIAN; MILLER'S ALGORITHM; TATE PAIRING;

CRYPTOGRAPHY;

EID: 58549111460     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89754-5_31     Document Type: Conference Paper

References (22)

1. Bernstein, D.J., Birkner, P., Joye, M., Lange, T., Peters, C.: Twisted Edwards curves. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol. 5023, pp. 389-405. Springer, Heidelberg (2008)
2. Bernstein, D.J., Lange, T.: Explicit-formulas database (2007), http://hyperelliptic.org/EFD/
3. Bernstein, D.J., Lange, T.: Faster addition and doubling on elliptic curves. In: Kurosawa. K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833. pp. 29-50. Springer, Heidelberg (2007)
4. Blake, I.F., Seroussi, G., Smart. N.P.: Advances in Elliptic Curve Cryptography. London Mathematical Society Lecture Note Series, vol. 317. Cambridge University Press. Cambridge (2005)
5. Boneh. D., Franklin, M.K.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213-229. Springer, Heidelberg (2001)
6. Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514-532. Springer, Heidelberg (2001)
7. Boneh, D., Shacham, H.: Group signatures with verifier-local revocation. In: Atluri, V., Pfitzmann, B., McDaniel. P. (eds.) ACM CCS 2004: 11th Conference on Computer and Communications Security, pp. 168-177. ACM Press, New York (2004)
8. Bosma, W.: Signed bits and fast exponentiation. J. de théorie des nombres de Bordeaux 13(1). 27-41 (2001)
9. Brezing, F., Weng, A.: Elliptic curves suitable for pairing based cryptography. Des. Codes Cryptography 37(1), 133-141 (2005)
10. Chatterjee, S., Sarkar, P., Barua, R.: Efficient computation of Tate pairing in projective coordinate over general characteristic fields (2004)
11. Das, M.P.L., Sarkar, P.: Pairing computation on twisted Edwards form elliptic curves. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209. Springer, Heidelberg (2008)
12. Edwards, H.M.: A normal form for elliptic curves. Bull. AMS 44, 393-422 (2007)
13. Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves. Cryptology ePrint Archive, Report 2006/372 (2006), http://eprint.iacr.org/
14. Granger, R., Hess, F., Oyono, R., Thériault, N., Vercauteren, F.: Ate pairing on hyperelliptic curves (2007)
15. Granger, R., Page, D., Smart, N.P.: High security pairing-based cryptography revisited. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 480-494. Springer, Heidelberg (2006)
16. Hartshorne, R.: Algebraic Geometry. Graduate texts in Mathematics, vol. 52. Springer. Heidelberg (1977)
17. Hess, F., Smart. N.P., Vercauteren, F.: The Eta Pairing Revisited. IEEE Transactions on Information Theory 52, 4595-4602 (2006)
18. Ionica, S., Joux, A.: Another approach on pairing computation in Edwards coordinates. Cryptology ePrint Archive, Report 2008/292 (2008), http://eprint.iacr.org/
19. Joux, A.: A one round protocol for tripartite Diffie-Hellman. Journal of Cryptology 17(4). 263-276 (2004)
20. Koblitz. N., Menezes, A.: Pairing-based cryptography at high security levels. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 13-36. Springer, Heidelberg (2005)
21. Miller, V.S.: The Weil pairing, and its efficient calculation. Journal of Cryptology 17(4). 235-261 (2004)
22. Silverman, J.H.: The Arithmetic of Elliptic Curves. Graduate texts in Mathematics, vol. 106. Springer, Heidelberg (1986)