Fast generation of elliptic curves with prime order over extension field of even extension degree

Yasuyuki Nogami, Yoshitaka Morikawa

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

3 Citations (Scopus)

Abstract

Information security technology has played a key role in protecting the equipment or some important information from evil internet users. RSA cryptosytem is the most widely used public-key cryptosystem but its key for ensuring sufficient security reachers about 2000 bits long. Hence, it is not efficient to implement RSA cryptosystem on terminal with scarce computation resources. On the other hand, elliptic curve cryptosystem (ECC) has the same security level with about 7-fold smaller length key as compared to RSA cryptosystem. Evidence suggests that ECC is more practical as compared to RSA.

Original languageEnglish
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages18
Number of pages1
Publication statusPublished - 2003
EventProceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan
Duration: Jun 29 2003Jul 4 2003

Other

OtherProceedings 2003 IEEE International Symposium on Information Theory (ISIT)
CountryJapan
CityYokohama
Period6/29/037/4/03

    Fingerprint

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Nogami, Y., & Morikawa, Y. (2003). Fast generation of elliptic curves with prime order over extension field of even extension degree. In IEEE International Symposium on Information Theory - Proceedings (pp. 18)