logo

SCIENCE CHINA Information Sciences, Volume 60, Issue 11: 119101(2017) https://doi.org/10.1007/s11432-016-0412-0

Generating pairing-friendly elliptic curves with fixed embedding degrees

More info
  • ReceivedJun 15, 2016
  • AcceptedAug 12, 2016
  • PublishedDec 13, 2016

Abstract

There is no abstract available for this article.


Supplement

Appendixes A–D, E.1, E.2, and F.


References

[1] Brezing F, Weng A. Elliptic Curves Suitable for Pairing Based Cryptography. Des Codes Crypt, 2005, 37: 133-141 CrossRef Google Scholar

[2] Barreto P S L M, Naehrig M. Pairing-friendly elliptic curves of prime order. In: Proceedings of the 12th International Conference on Selected Areas in Cryptography. Berlin: Springer, 2005. 319--331. Google Scholar

[3] Barreto P S L M, Lynn B, Scott M. Constructing elliptic curves with prescribed embedding degrees. In: Proceedings of the 3rd International Conference on Security in Communication Networks. Berlin: Springer, 2002. 263--273. Google Scholar

[4] Miyaji A, Nakabayashi M, Takano S. New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans Fund Electron Commun Comput Sci, 2001, 84: 1234--1243. Google Scholar

[5] Scott M, Barreto P S L M. Generating More MNT Elliptic Curves. Des Codes Crypt, 2006, 38: 209-217 CrossRef Google Scholar

[6] Pohlig S, Hellman M. An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.). IEEE Trans Inform Theor, 1978, 24: 106-110 CrossRef Google Scholar

[7] Freeman D, Scott M, Teske E. A Taxonomy of Pairing-Friendly Elliptic Curves. J Cryptol, 2010, 23: 224-280 CrossRef Google Scholar

Copyright 2019 Science China Press Co., Ltd. 《中国科学》杂志社有限责任公司 版权所有

京ICP备18024590号-1