The research of generating secure elliptic curve over GF(p)

Ai Qin Hou*, Bao Jian Gao, Jun Wang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

Generating a secure elliptic curve is complicated and there are only a few algorithms for some special elliptic curves at present. In this paper an algorithm of generating an elliptic curve over prime field GF (p) with a prime number order is discussed. Another algorithm of generating an elliptic curve with an order which equals to the product of two prime numbers is proposed.

Original languageEnglish (US)
Title of host publication2009 1st International Conference on Information Science and Engineering, ICISE 2009
Pages1909-1911
Number of pages3
DOIs
StatePublished - Dec 1 2009
Event1st International Conference on Information Science and Engineering, ICISE2009 - Nanjing, China
Duration: Dec 26 2009Dec 28 2009

Conference

Conference1st International Conference on Information Science and Engineering, ICISE2009
CountryChina
CityNanjing
Period12/26/0912/28/09

Keywords

  • Base point of EC
  • Elliptic curve (EC)
  • Order of a point on EC
  • Order of an EC

ASJC Scopus subject areas

  • Information Systems

Cite this

Hou, A. Q., Gao, B. J., & Wang, J. (2009). The research of generating secure elliptic curve over GF(p). In 2009 1st International Conference on Information Science and Engineering, ICISE 2009 (pp. 1909-1911). [5455249] https://doi.org/10.1109/ICISE.2009.1270