Professional Documents
Culture Documents
Encryption/decryption
Digital signature
Yes
Yes
Yes
Yes
Yes
No
No
Yes
Table.1 applications of public key cryptosystem
Key exchange
Yes
Yes
Yes
No
_______________________________________________________________________________________________________________
ISSN: 2278-2311
IJIRAE | http://Ijirae.com
2014, IJIRAE All Rights Reserved
Page - 41
-------------------------------------- EQ 1
-------------------------------------- EQ 2
---------------------------------------EQ 3
--------------------------------------- EQ 4
Cryptography purposes we always use a finite field a1, a2, a3, a4, a6 are real numbers belong to R, x and y take values in the real
numbers. If L is an extension field of real numbers, then the set of L-rational points on the Elliptic curve is called Weierstrass equation.
The following algorithm gives the points on the curve Eq2 (a,b) [12]
Algorithm elliptic-points (p,a,b)
{
X=0
While(x<p)
{
W=(x3+ax+b) mod p
If (w is perfect square in Zp)
Output ((x,w).(x,- w))
X=x+1
}
}
The number of points on an elliptic curve over a finite field must satisfy Hasses theorem. The order of the curve N will satisfy the
following equation [8][10][12]
P+1-2pNp+1=2p
\
Figure: 1 Point Doubling
Point additions (PA) and point doublings (PD) can be implemented using coordinate system [13] like affine coordinate system, standard
projective, Standard projective and affine, Jacobian projective and affine, lopez-Dahab. The most popular coordinate representation is
affine repetition which is based on two coordinate (x,y) and other representation such as projective Jacobian, lopez-dahab uses three
coordinates , Transforming affine coordinates into one of the other representation is almost simple but not vice versa, since
transformation requires costlier field inversion[3][7]. The addition of two points on an elliptic curve. Elliptic curves have the interesting
property that adding two points on the elliptic curve results a third point on the curve. Therefore, adding two points, P1 and P2, gets us
point P3, also on the curve. Small changes in P1 or P2 can cause a large change in the position of P3. Point addition is the addition of two
points J and K on an elliptic curve to obtain another point L on the same elliptic curve and point doubling is the addition of a point J on
the elliptic curve to itself to obtain another point L.
V. SECURITY OF ELLIPTIC CURVE CRYPTOGRAPHY
Security is the most attractive feature of elliptic curve cryptography. Elliptic curve cryptosystems also are more computationally efficient
than the first generation public key system like RSA, DSA and Diffie-Hellman key exchange algorithm. Table 1 gives approximate
equivalent key size for ECC and RSA algorithm.
_______________________________________________________________________________________________________________
ISSN: 2278-2311
IJIRAE | http://Ijirae.com
2014, IJIRAE All Rights Reserved
Page - 42
From table 1 it is clear to see that ECC affords the same security as RSA while using significantly smaller key sizes. In Table 1, at all
levels of security including 512 bits, ECC has smaller public key sizes than both RSA and DSA/DH. Because of its smaller key size, ECC
outperforms both RSA and DSA/DH for most routine operations while offering comparable levels of security. The reason is that ECC
provides greater efficiency in terms of computational overheads, key sizes and bandwidth. In implementations, these saving mean higher
speeds, lower power consumption. For efficient cryptosystem implementation ANSI (American National Standard Institute) and NIST
(National Institute of Standard and Technology) are producing standards and technology [3][8].
Time to break in MIPS years
104
108
1011
1020
1078
_______________________________________________________________________________________________________________
ISSN: 2278-2311
IJIRAE | http://Ijirae.com
2014, IJIRAE All Rights Reserved
Page - 43
[1] Dr.R.Shanmugalakshremi. M.Prabu Research Issues on Elliptic Curve Cryptography and its applications IJCSNS International
Journal of Computer Science and Network Security, VOL.9 No.6, June 2009.
[2] F.Amin, A.H.Jahngir and H.rasifard Analysis of Public-key cryptography for wireless sensor network security World Academy of
science , Engineering and Technology41 2008.
[3] www.certicom.com
[4] William Stallings Cryptography and network security principles and practice Fifth edition , person, 2011.
[5] Behrouz A Forouzan, Debdeep Mukhopadhyay cryptography and network security Second edition. Mc-Graw Hill,2008.
[6] Sameer Hasan Al_Bakir, M.L. mat kiah, a.a.Zaidan, B.B.Zaidan and Gazi Mahabubul Alam, securing Peer to peer mobile
communications using public key cryptography: new Security strategy. International Journal of the physical SciencesVol.6
(4),pp.930-938,Februray,2011.
[7] Sonail Nimbhorkar, Dr.L.G.Malik Prospective Utilization of Elliptic Curve Cryptography for security Enhancement International
Journal of Application or Innovation in Engineering & Management (IJAIEM), volume 2, Issue 1 January 2013
[8] William Stallings. Cryptography and Network Security Principles and practices, fourth edition , prentice Hall, 2006.
[9] S.Kim and A.L.N.Reddy. A.Study of Analyzing Network Traffic as Image in Real-Time. In IEEE International conference of
communication, 2005.
[10] Sonail Nimbhorkar, Dr.L.G.Malik A survey on Elliptic curve cryptography (ECC) International Journal Advanced Studies in
Computers, Science and Engineering vol,1,issue 1,pp,1.5,July 2012.
[11] Alpesh R.Mishra and Abhilash Mandloi, Implementation of Cryptography Algorithm for GSM and UMTS System International
Journal of Network Security & and its Application (IJNSA), vol.3, no.6,pp,1-5, November 2011.
[12] Ranbir Soram, Mobile SMA Banking Security using elliptic curve cryptosystem, IJCSNS International Journal of Computer
Science and Network Security, vol.9 no.6,pp,30-38,June.2009.
[13] Mrs.megha Kolhekar Implementation of Elliptic curve cryptography on text. And Image International Journal of Enterprise
Computing and Business System ISSN(online):2230 2230-8849 vol.1 Issue 2 July 2011.
[14] Pedro Casas,johan Mazel. Steps Toward Autonomous Network Security: Unsupervised Detection of Network Attacks, IEEE
International Conference of communication 2011.
[15]Andrej Dujella Applications of elliptic curves in public key cryptography Basque Center for applied Mathematics and Universidad
del Pais Vasco / Euskal Herriko Unibertsitatea, Bilbao, May 2011.
[16]Pradeep Malik Elliptic Curve Cryptography for security Inwireless Networks Statistics 2011 Canada: 5th Canadian Conference in
Applied Statistical Techniques, july 1-4-2011, Concordia University, Montreal, Quebec, Canada.
[17]LIU Shuanggen, LI Ping, HU Yupu improvement Schemes for Scalar Multiplication Algorithm in Elliptic Curve Cryptography
ISSN:1000-3428.0.2006-17-009.
[18] Tingdingchen,Huiyun Li,Keke Wu, Fengqi Yu Evaluation criterion of side channel countermeasures for elliptic cryptography
devices DOIIO.1109/iCCCs.2009.13.
[19]Xue Sun,Mingping Xia An improved proxy signature based on elliptic curve cryptography DoI10.1109/ICCCS.2009.36.
_______________________________________________________________________________________________________________
ISSN: 2278-2311
IJIRAE | http://Ijirae.com
2014, IJIRAE All Rights Reserved
Page - 44