New polynomial families for generating more suitable elliptic curve for pairing-based cryptosystems

WSEAS Transactions on Computers

Volumn 5, Issue 3, 2006, Pages 528-535

  Duan, Pu ^a   Cui, Shi ^a   Chan, Choong Wah ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Cyclotomic polynomials; Irreducible polynomials; Pairing friendly elliptic curves; Polynomial families

Indexed keywords

ALGORITHMS; CRYPTOGRAPHY; MATHEMATICAL MODELS;

CYCLOTOMIC POLYNOMIALS; IRREDUCIBLE POLYNOMIALS; PAIRING-FRIENDLY ELLIPTIC CURVES; POLYNOMIAL FAMILIES;

POLYNOMIALS;

EID: 33645158804     PISSN: 11092750     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. M. Scott and P. S. L. M. Barreto. Generating more MNT elliptic curves. Cryptology ePrint Archive, Report 2004/058, 2004.
2. IEEE Computer Society, New York, USA. IEEE Standard Specifications for Public Key Cryptography- IEEE Std 1363-2000, 2000.
3. S. D. Galbraith, J. Mckee and P. Valenca. Ordinary abelian varieties having small embedding degree. Cryptology ePrint Archive, Report 2004/ 365, 2004.
4. A. Murphy and N. Fitzpatrick. Elliptic curves for pairing applications. Cryptology ePrint Archive, Report 2005/302, 2005.
5. P. Duan, S. Cui and C. W. Chan. Effective polynomial families for generating more pairing-friendly elliptic curves. Cryptology ePrint Archive, Report 2005/236, 2005.
6. 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, vol. 11, pp. 141-145, 1998.
7. F. Brezing and A. Weng. Elliptic curves suitable for pairing based cryptography. Cryptology ePrint Archive, Report 2003/143, 2003.
8. 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.
9. A. M. Odlyzko. Discrete logarithms: the past and the future. Design, Codes and Cryptography, 19:129-145, 2000.
10. A. Menezes, T. Okamoto, and S. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite field. Proc.22nd Annual ACM Symposium on the Theory of Computing, pp. 80-89, 1991.
11. D. Page, N. P. Smart and F. Vercauteren. A comparison of MNT curves and supersingular curves. Cryptology ePrint Archive, Report 2004/165, 2004.
12. D. Boneh and M. Franklin. Identity based encryption from the Weil pairing. SIAM Journal. of Computing, vol. 32, no.3, pp. 586-615, 2003.
13. D. Boneh, B. Lynn and H. Shacham. Short signatures from the Weil pairing. Advances in Cryptology - Asiacrypt'2001, volume 2248 of Lecture Notes in Computer Science, page 514-532, Springer-Verlag, 2002.
14. 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.
15. G. Frey, M. Muller and H. G Ruck. The Tate Pairing and the Discrete Logarithm Applied to Elliptic Curve Cryptosystems. IEEE Transactions on Information Theory, Vol 45, 1999.
16. 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.
17. P. S. L. M. Barreto and M. Naehrig. Pairing-Friendly Elliptic Curves of Prime Order. Cryptology ePrint Archive, Report 2005/133, 2005.
18. N. Koblitz and A. Menezes. Pairing-based cryptography at high security levels. Cryptography ePrint Archive, Report 2005/076, 2005.
19. S. Galbraith, K. Harrison and D. Soldera. Implementing the Tate pairing. In Algorithm Number Theory Symposium - ANTS V, volume 2369 of Lecture Notes in Computer Science, pages 324-337. Springer - Verlag, 2002.
20. P. S. L. M. Barreto, H. Y. Kim, B. Lynn and M. Scott. Efficient algorithms for pairing-based cryptosystems. In Advances in Cryptology - Crypto' 2002, volume 2442 of Lecture Notes in Computer Science, pages 354-368. Springer-Verlag, 2002.
21. P. S. L. M. Barreto, B. Lynn and M. Scott. Efficient implementation of pairing-based cryptosystems. Journal of Cryptology, 17(4): 321-334, 2004.