Efficient implementation of pairing-based cryptosystems

Journal of Cryptology

Volumn 17, Issue 4, 2004, Pages 321-334

  Barreto, Paulo S L M ^a   Lynn, Ben ^b   Scott, Michael ^c  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b Stanford University   (United States)

^c DUBLIN CITY UNIVERSITY   (Ireland)

Author keywords

Efficient implementation; Elliptic curve construction; Pairing based cryptosystem; Tate pairing

Indexed keywords

CURVE FITTING; EMBEDDED SYSTEMS;

EFFICIENT IMPLEMENTATION; ELLIPTIC CURVE CONSTRUCTION; PAIRING-BASED CRYPTOSYSTEMS; TATE PAIRING;

CRYPTOGRAPHY;

EID: 23044435243     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00145-004-0311-z     Document Type: Article

References (28)

1. R. Balasubramanian and N. Koblitz. The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm. Journal of Cryptology, 11(2):141-145, 1998.
2. P.S.L.M. Barreto, H. Y. Kim, B. Lynn, and M. Scott. Efficient algorithms for pairing-based cryptosystems. In Advances in Cryptology - Ciypto 2002, pages 354-368. Volume 2442 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2002.
3. P.S.L.M. Barreto, B. Lynn, and M. Scott. Constructing elliptic curves with prescribed embedding degrees. In Security in Communication Networks - SCN 2002, pages 263-273. Volume 2576 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2002.
4. P.S.L.M. Barreto, B. Lynn, and M. Scott. On the selection of pairing-friendly groups. In Selected Areas in Cryptography - SAC. 2003, pages 17-25. Volume 3006 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2003.
5. I. Blake, G. Seroussi, and N. Smart. Elliptic Curves in Cryptography. Cambridge University Press, London, 1999.
6. D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. SIAM Journal of Computing, 32(3):586-615, 2003.
7. D. Boneh, B. Lynn, and H. Shacham. Short signatures from the Weil pairing. In Advances in Cryptology -Asiacrypt 2001, pages 514-532. Volume 2248 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2002.
8. F. Brezing and A. Weng. Elliptic curves suitable for pairing based cryptography. Cryptology ePrint Archive, Report 2003/143, 2001. http://eprint.iacr.org/2003/143.
9. D. Coppersmith. Fast evaluation of logarithms in fields of characteristics two. In IEEE Transactions on Information Theory, 30: 587-594, 1984.
10. R. Crandall and C. Pomerance. Prime Numbers: a Computational Perspective. Springer-Verlag, Berlin, 2001.
11. R. Dupont, A. Enge, and F. Morain. Building curves with arbitrary small MOV degree over finite prime fields. Cryptology ePrint Archive, Report 2002/094, 2002. http://eprint.iacr.org/2002/094.
12. p -x + d. In Advances in Cryptology - Asiacrypt 2003, pages 111-123. Volume 2894 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2003.
13. G. Frey, M. Müller, and H. Rück. The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems. IEEE Transactions on Information Theory, 45(5):1717-1719, 1999.
14. S. Galbraith. Supersingular curves in cryptography. In Advances in Cryptology - Asiacrypt 2001, pages 495-513. Volume 2248 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2002.
15. S. Galbraith, K. Harrison, and D. Soldera. Implementing the Tate pairing. In Algorithm Number Theory Symposium - ANTS V, pages 324-337. Volume 2369 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2002.
16. IEEE P1363 Working Group. Standard Specifications for Public-Key Gryptography - IEEE Std 1363-2000, 2000.
17. K. Ireland and M. Rosen. A Classical Introduction to Modern Number Theory. 2nd edition. Springer-Verlag, Berlin, 1990.
18. A. Joux and K. Nguyen. Separating decision Diffie-Hellman from Diffie-Hellman in cryptographic groups. Cryptology ePrint Archive, Report 2001/003, 2001. http://eprint.iacr.org/2001/003.
19. R. Lidl and H. Niederreiter. Finite Fields, 2nd edition. Number 20 in Encyclopedia of Mathematics and its Applications. Cambridge University Press, 1997.
20. A. Menezes. Elliptic Curve Public Key Cryptosystems. Kluwer, Dordrecht, 1993.
21. A. Menezes, T. Okamoto, and S. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Transactions on Information Theory, 39:1639-1646, 1993.
22. V. Miller. Short programs for functions on curves. Unpublished manuscript, 1986.
23. A. Miyaji, M. Nakabayashi, and S. Takano. New explicit conditions of elliptic curve traces for FR-reduction. IEICE Transactions on Fundamentals, E84-A(5):1234-1243, 2001.
24. T. Nagell. Introduction to Number Theory, 2nd edition. Chelsea, New York, 2001.
25. O. Schirokauer, D. Weber, and T. Denny. Discrete logarithms: the effectiveness of the index calculus method. In Algorithm Number Theory Symposium - ANTS II, pages 337-361. Volume 1122 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1996.
26. J.H. Silverman. The. Arithmetic of Elliptic Curves. Number 106 in Graduate Texts in Mathematics. Springer-Verlag, Berlin, 1986.
27. N.P. Smart. The Algorithmic Resolution of Diophantine Equations. Number 41 in London Mathematical Society Student Texts. Cambridge University Press, London, 1998.
28. N. Tzanakis. Solving elliptic diophantine equations by estimating linear forms in elliptic logarithms: the case of quartic equations. Acta Arithmetica, 75:165-190, 1996.