Pairing-friendly elliptic curves of prime order

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

Volumn 3897 LNCS, Issue , 2006, Pages 319-331

  Barreto, Paulo S L M ^a   Naehrig, Michael ^b  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Elliptic curves; Pairing based cryptosystems

Indexed keywords

ABILITY TESTING; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; CRYPTOGRAPHY; LARGE SCALE SYSTEMS;

ELLIPTIC CURVES; PAIRING-BASED CRYPTOSYSTEMS; POINT REDUCTION TECHNIQUES;

EMBEDDED SYSTEMS;

EID: 33745604534     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11693383_22     Document Type: Conference Paper

References (19)

1. P. S. L. M. Barreto, B. Lynn, and M. Scott. Constructing elliptic curves with prescribed embedding degrees. In Security in Communication Networks - SCN'2002, volume 2576 of Lecture Notes in Computer Science, pages 263-273. Springer-Verlag, 2002.
2. P. S. L. M. Barreto, B. Lynn, and M. Scott. On the selection of pairing-friendly groups. In Selected Areas in Cryptography - SAC'2003, volume 3006 of Lecture Notes in Computer Science, pages 17-25. Springer-Verlag, 2003.
3. P. S. L. M. Barreto, B. Lynn, and M. Scott. Efficient implementation of pairing-based cryptosystems. Journal of Cryptology, 17(4):321-334, 2004.
4. I. Blake, G. Seroussi, and N. Smart. Advances in Elliptic Curve Cryptography. Number 317 in London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge, UK, 2005.
5. D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. SIAM Journal of Computing, 32(3):586-615, 2003.
6. D. Boneh, B. Lynn, and H. Shacham. Short signatures from the Weil pairing. In Advances in Cryptology - Asiacrypt'2001, volume 2248 of Lecture Notes in Computer Science, pages 514-532. Springer-Verlag, 2002.
7. D. Boneh, B. Lynn, and H. Shacham. Short signatures from the Weil pairing. Journal of Cryptology, 17(4):297-319, 2004.
8. F. Brezing and A. Weng. Elliptic curves suitable for pairing based cryptography. Cryptology ePrint Archive, Report 2003/143, 2003. Available from http://eprint.iacr.org/2003/143.
9. R. Dupont, A. Enge, and F. Morain. Building curves with arbitrary small MOV degree over finite prime fields. Journal of Cryptology, 18(2):79-89, 2005.
10. S. Galbraith, J. McKee, and P. Valença. Ordinary abelian varieties having small embedding degree. Cryptology ePrint Archive, Report 2004/365, 2004. Available from http://eprint.iacr.org/2004/365.
11. R. Granger, D. Page, and M. Stam. On small characteristic algebraic tori in pairing-based cryptography. Cryptology ePrint Archive, Report 2004/132, 2004. Available from http://eprint.iacr.org/2004/132.
12. IEEE Computer Society, New York, USA. IEEE Standard Specifications for PublicKey Cryptography - IEEE Std 1363-2000, 2000.
13. G.-J. Lay and H. G. Zimmer. Constructing elliptic curves with given group order over large finite fields. In Algorithmic Number Theory Symposium - ANTS-I, volume 877 of Lecture Notes in Computer Science, pages 250-263. Springer-Verlag, 1994.
14. A. K. Lenstra and E. R. Verheul. The xtr public key system. In Advances in Cryptology - Crypto'2000, volume 1880 of Lecture Notes in Computer Science, pages 1-19, Santa Barbara, USA, 2000. Springer-Verlag.
15. 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.
16. F. Morain. Building cyclic elliptic curves modulo large primes. In Advances in Cryptology - Eurocrypt'1991, volume 547 of Lecture Notes in Computer Science, pages 328-336. Springer-Verlag, 1991.
17. K. Rubin and A. Silverberg. Supersingular abelian varieties in cryptology. In Advances in Cryptology - Crypto '2002, volume 2442 of Lecture Notes in Computer Science, pages 336-353. Springer-Verlag, 2002.
18. M. Scott and P. S. L. M. Barreto. Compressed pairings. In Advances in Cryptology Crypto'2004, volume 3152 of Lecture Notes in Computer Science, pages 140-156, Santa Barbara, USA, 2004. Springer-Verlag.
19. M. Scott and P. S. L. M. Barreto. Generating more MNT elliptic curves. Designs, Codes and Cryptography, 2005. To appear.