DocumentCode :
2000444
Title :
Fast generation of elliptic curves with prime order over extension field of even extension degree
Author :
Nogami, Yasuyuki ; Morikawa, Yoshitaka
Author_Institution :
Dept. of Eng., Okayama Univ., Japan
fYear :
2003
fDate :
29 June-4 July 2003
Firstpage :
18
Abstract :
In order to protect the equipment or some important information from evil Internet users, information security technology has played a key role. RSA cryptosystem is the most widely used public-key cryptosystem but its key for ensuring sufficient security reaches about 2000 bits long. Therefore, 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, it is said that ECC is more practical as compared to RSA.
Keywords :
Internet; public key cryptography; Internet users; elliptic curve cryptosystem; even extension degree; fast generation algorithm; information security technology; prime order elliptic curves; public-key cryptosystem; Costs; Elliptic curve cryptography; Elliptic curves; Equations; Galois fields; Information security; Internet; Polynomials; Protection; Public key cryptography;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2003. Proceedings. IEEE International Symposium on
Print_ISBN :
0-7803-7728-1
Type :
conf
DOI :
10.1109/ISIT.2003.1228032
Filename :
1228032
Link To Document :
بازگشت