Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
ISSN 2250-3153
642
www.ijsrp.org
International Journal of Scientific and Research Publications, Volume 6, Issue 6, June 2016
ISSN 2250-3153
643
.
Figure.2.Group law on an Elliptic Curve
Elliptic Curve Cryptography (ECC) has been regarded
mature to provide robustness for secure data transaction.
Compared with RSA,
ECC can supply equivalent level of
security with a much smaller key length. Therefore, ECC has
become an attractive alternative cryptosystem and many designs
have been proposed in recent years among them, there are dualfield ECC implementations that support both binary field
GF(2m).
The primary advantage is that ECC is based on either
integer factorization or the discrete log problem in the
multiplicative group of a finite field in the absence of a sub
exponential-time algorithm.
ECC uses smaller key size as compared to RSA. As a
result it achieves greater speed and less storage.
Key pair generation is much faster than other algorithm.
Greater flexibility.
www.ijsrp.org
International Journal of Scientific and Research Publications, Volume 6, Issue 6, June 2016
ISSN 2250-3153
644
12: return(X 3 ,Z 3 )
13: Mdouble(X 1 ,Z 1 ) // Point Double
14: Z 1 2 = Z 1 2X 1 2 ,X 1 2 = X 1 4 + bZ4
15: return(X 2 ,Z 2 )
16: Mxy(X 1 ,Z 1 ,X 2 ,Z 2 ) // Coordinate Conversion
17: X = X 1 /Z 1 , Y = (x+X)(y+x2 +(X 2 /Z 2 +x)(X1/Z1 +x))/x+y
18: return(X,Y)
HARDWARE AND SOFTWARE TOOLS
Modelsim
Alteras Quartus II software and SOPC Builder
Nios II IDE
The Nios Development Board, Cyclone II
SIMULATION RESULT
The web server is implemented using NIOS II altera board
provides area and power consumption. The web pages can be
shared with registered clients also the security achieved through
ECC
Figure 3.Bock diagram of ECC
The following table to demonstrate the key size relationship
between ECC and RSA
ECC
Size
163
256
384
512
Key
RSA Key
Size
1,024
3,072
7,680
15,360
Key-Size Ratio
1:6
1:12
1:20
1:30
ALGORITHM
Input: A point P = (x, y), an l-bit integer k = (kl1, . . . , k1, k0).
Output: Q = kP.
1: X 1 = x, Z 1 = 1, X 2 = x4 +, Z 2 = x 2 .
2: for i = l2 to 0 by 1 do
3: if ki = 1 then
4: (X 1 ,Z 1 ) = Madd (X 1 ,Z 1 ,X 2 ,Z 2 ), (X 2 ,Z 2 ) = Mdouble(X 2 ,Z 2 )
5: else
6: (X 2 ,Z 2 ) = Madd (X 1 ,Z 1 ,X 2 ,Z 2 ), (X 1 ,Z 1 ) = Mdouble(X 1 ,Z 1 )
7: end if
8: end for
9: Q = Mxy(X 1 ,Z 1 ,X 2 ,Z 2 )
10: Madd (X 1 ,Z 1 ,X 2 ,Z 2 ) // Point Addition
11: Z3 = (X 1 Z 2 +X 2 Z 1 )2, X 3 = xZ 3 +(X 1 Z 2 )(X 2 Z 1 )
www.ijsrp.org
International Journal of Scientific and Research Publications, Volume 6, Issue 6, June 2016
ISSN 2250-3153
645
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
[15]
[16]
[17]
[18]
[19]
IV. CONCLUSION
Implementing Nios II processor on FPGA allows more
flexibility on both hardware and software. ECC provides time as
well as power consumption too. This makes it an ideal choice for
portable, mobile and low power applications. It can be a very
secure and useful replacement of already being used
cryptosystems for key exchange, key agreement and mutual
authentication After downloading the VHDL software program
AUTHORS
First Author Mrs.K.Sasikala M.E, Department of ECE ,
Thangavelu engineering college, Karapakkam, Chennai-97
Second Author Mrs.S.Kalaivani M.Tech, Department of ECE
, Thangavelu engineering college, Karapakkam, Chennai-97
www.ijsrp.org
International Journal of Scientific and Research Publications, Volume 6, Issue 6, June 2016
ISSN 2250-3153
646
www.ijsrp.org