An Optimization Base Point Choice Algorithm of ECC on GF(p)

Author

Hu, Yan ; Cui, Yan-yan ; Li, Tong

Author_Institution

Sch. of Inf. Sci. & Eng., Yunnan Univ., Kunming, China

Volume

4

fYear

2010

Firstpage

103

Lastpage

105

Abstract

The key points of improving the efficiency of base point choice algorithm of ECC on GF (p) are judging quadratic residue, getting Y-coordinate and scalar multiplication. A new algorithm of judging quadratic residue and getting Y-coordinate is proposed and analyzed in the paper by defining a min class of quadratic residue, and some methods for improving the efficiency of scalar multiplication are discussed in the paper. The analyzing result tells that the new algorithm can improve the speed of judging quadratic residue and getting Y-coordinate, so the efficiency of the whole base point choice is improved.

Keywords

computational complexity; optimisation; public key cryptography; ECC; base point choice algorithm; discrete logarithm problem; elliptic curve cryptography; elliptic curve discrete logarithm; optimization; quadratic residue; scalar multiplication; Algorithm design and analysis; Computational modeling; Computer simulation; Elliptic curve cryptography; Elliptic curves; Galois fields; Information science; Safety; Security; Software algorithms; base point; elliptic curve; quadratic residue; scalar multiplication;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Modeling and Simulation, 2010. ICCMS '10. Second International Conference on

Conference_Location

Sanya, Hainan

Print_ISBN

978-1-4244-5642-0

Electronic_ISBN

978-1-4244-5643-7

Type

conf

DOI

10.1109/ICCMS.2010.128

Filename

5421510