Abstract
In their seminal paper, Miyaji et al. [13] describe a simple method for the creation of elliptic curves of prime order with embedding degree 3, 4, or 6. Such curves are important for the realisation of pairing-based cryptosystems on ordinary (non-supersingular) elliptic curves. We provide an alternative derivation of their results, and extend them to allow for the generation of many more suitable curves.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. S. L. M. Barreto, H. Y. Kim, B. Lynn and M. Scott, Efficient algorithms for pairing-based crytosystem. In Advances in Cryptology – Crypto ’2002, Vol. 2442 of Lecture Notes in Computer Science, Springer-Verlag, (2002) pp. 354–368.
P. S. L. M. Barreto, B. Lynn and M. Scott, Constructing elliptic curves with prescribed embedding degrees. In Security in Communication Networks - SCN. ’2002, Vol. 2576 of Lecture Note in Computer Science, Springer-Verlg, (2002), pp. 263–273.
D. Boneh M. Franklin (2003) ArticleTitleIdentity-based encryption from the Weil pairing SIAM J. Comput. 32 IssueID3 586–615 Occurrence Handle10.1137/S0097539701398521 Occurrence Handle2004m:94035
D. Boneh, B. Lynn and H. Shacham, Short signatures from the Weil pairing. In Advances in Cryptology – Asiacrypt’ 2001, Vol. 2248 of Lecture Notes in Computer Science, Springer-Verlag, (2002), pp. 514–532.
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.
D. Coppersmith (1984) ArticleTitleFast evaluation of logarithms in fields of characteristics two IEEE Trans. Inform. Theory 30 587–594 Occurrence Handle0554.12013 Occurrence Handle85h:65041
R. Crandall C. Pomerance (2001) Prime Numbers: A Computational Perspective Springer-Verlag Berlin
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.
S. Galbraith, K. Harrison and D. Soldera, Implementing the Tate pairing. Algorithm Number Theory Symposium – ANTS V, Vol. 2369 of Lecture Notes in Computer Science, Springer-Verlag, (2002) pp. 324–337.
IEEE Computer Society, New York, USA. IEEE Standard Specifications for Public-Key Cryptography – IEEE Std 1363:2000, 2000
R. Lidl and H. Niederreiter, Finite Fields. Number 20 in Encyclopedia of Mathematics and its Applications, 2nd ed., Cambridge University Press, Cambridge, UK, (1997).
A. Menezes, Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers (1993).
A. Miyaji M. Nakabayashi S. Takano (2001) ArticleTitleNew explicit conditions of elliptic curve traces for FR-reduction IEICE Trans. Fundamentals E84-A IssueID5 1234–1243
A. M. Odlyzko (2000) ArticleTitleDiscrete logarithms: the past and the future Design, Codes Cryptog. 19 129–145 Occurrence Handle1033.11057 Occurrence Handle1759614
J. H. Silverman (1986) The Arithmetic of Elliptic Curves Springer-Verlag Berlin
N. P. Smart (2002) ArticleTitleAn identity based authenticated key agreement protocol based on the Weil pairing Electronics Lett. 38 630–632 Occurrence Handle10.1049/el:20020387
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by: P. Wild
Research supported by Enterprise Ireland grant IF/2002/0312/N.
Rights and permissions
About this article
Cite this article
Scott, M., Barreto, P.S.L.M. Generating More MNT Elliptic Curves. Des Codes Crypt 38, 209–217 (2006). https://doi.org/10.1007/s10623-005-0538-1
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10623-005-0538-1