Implementation of Embedded Mobile Device Elliptic Curve Algorithm Fast Generating Algorithm

Article Preview

Abstract:

Elliptic curve cryptosystem is used in the process of embedded systems, the selection and generation algorithm of the elliptic curve will directly affect the efficiency of systems. From Elliptic Curve's selection, Elliptic Curve's structure, Elliptic Curve's generation, this paper discussed the realization of a random elliptic curve method of Embedded Mobile Device, the SEA algorithm and its improved algorithm. The results show that this method can achieve a quick implementation of the elliptic curve method to improve the operating efficiency of embedded systems in the same security guarantees.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 694-697)

Pages:

2599-2603

Citation:

Online since:

May 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Menezes A,Okamoto T,Vanstone S. Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field [J]. IEEE Transactions on Information Theory,1993,39(2):1639~1646

DOI: 10.1109/18.259647

Google Scholar

[2] Smart,N.,The Discrete Logarithm Problem on Elliptic Curves of Trace One .Journal of Cryptology. 1999, Vol.12, No.3 .193-196

DOI: 10.1007/s001459900052

Google Scholar

[3] Garcia-Selfa Irene,Olalla Miguel A., Tomero Jose M., Computing the Rational Torsion of an Elliptic Curve Using Tate Normal Form,Journal of Number Theory,2002.9. , 96(l),.76-88

DOI: 10.1006/jnth.2002.2780

Google Scholar

[4] Koblitz N.,CM-Curve with Good Cryptographic Properties,Advances in Cryptology Crypto'91,LNCS576,1991,Springer-Verlag,279-287

DOI: 10.1007/3-540-46766-1_22

Google Scholar

[5] Lay,G.,and Zimmer,H. Constructing Elliptic Curves With Given Group Order Over Large Finite Fields,Algorithmic Number Theory: First International Symposium,Lecture Notes in Computer Science 1994 (877),Springer-Verlag,250-263

DOI: 10.1007/3-540-58691-1_64

Google Scholar

[6] Xiao Youan and Li Layuan A New Quick Public Key Crypto System Based on the Difficulty of Factoring Very Large Numbers,2001 International Symposium on Distributed Computing and Applications to Business,Engineering and Science DCABES'2001,230-234

Google Scholar

[7] Vanstone S A,Zuccherato R J. Elliptic curve cryptosystems using curves of smooth order the ringZn [J] .IEEE Trans Inform Theory,1997,43(7):1231-1237.

DOI: 10.1109/18.605586

Google Scholar

[8] Xiao Youan , Researches Elliptic Curve Public Key Cryptosystems in Network Information Security WuHan University of Technology Dissertation of .PH.D (2003)

Google Scholar

[9] CIETM, JOYEM, LAUTER K,et al. Trading inversions for multiplications in elliptic curve cryptography[J].Designs, Codes and Cryptography, 2006,39(2): 189-206.

DOI: 10.1007/s10623-005-3299-y

Google Scholar

[10] LIU Lian-hao, SHEN Yong. Fast algorithm for scalar multiplication in elliptic curves cryptography [J]. Application Research of Computers, 2009,26( 3):1104-1108

Google Scholar