0% found this document useful (0 votes)
48 views

Optimization of ECC Using Twist Algoritm

The document proposes optimizing elliptic curve cryptography using twist algorithms to decrease execution time. Experimental results show the optimized approach reduced average encryption time to 0.290 seconds from 0.566 seconds and reduced average decryption time to 0.304 seconds from 0.368 seconds originally. This makes elliptic curve cryptography more efficient and suitable for widespread use.

Uploaded by

api-3711728
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
48 views

Optimization of ECC Using Twist Algoritm

The document proposes optimizing elliptic curve cryptography using twist algorithms to decrease execution time. Experimental results show the optimized approach reduced average encryption time to 0.290 seconds from 0.566 seconds and reduced average decryption time to 0.304 seconds from 0.368 seconds originally. This makes elliptic curve cryptography more efficient and suitable for widespread use.

Uploaded by

api-3711728
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 18

Guide

Mr.D.Balamurugan
Sr.Lecturer/CSE

Team
Karthe U.K
Naresh Kumar.S
Naveen.V
Daniel Vinod Anand.B
The existing scheme of Elliptic curve
cryptography has a few drawbacks such as
slower execution speed and lower
efficiency. The proposed scheme provides
a solution by optimizing ECC with the help
of Twist algorithm.
 Greater key size of RSA

 RSA is prone to attacks and is not strong

 Less secure
 In the proposed system, the actual ECC is not used as
it is, but an optimized ECC is used.

 As a result Execution time is decreased


 Twisting the curve to an equivalent one, for which
the coefficient of x is small has high probability to be
effective.

 This in turn affords some considerable speedup in


execution
TRIAL NO ENCRYPTION DECRYPTION
TIME (SEC) TIME (SEC)
1 0.70 0.14
2 0.80 0.50
3 0.45 0.15
4 0.14 0.14
5 0.74 0.91
TRIAL NO. ENCRYPTION TIME (SEC) DECRYPTION TIME (SEC)

1 0.02 0.18
2 0.64 0.22
3 0.10 0.27
4 0.26 0.21
5 0.46 0.64
NO ENCRYPTION DECRYPTION ENCRYPTION DECRYPTION
TIME (SEC) TIME (SEC) TIME (SEC) TIME (SEC)
(ECC) (ECC) (OPTIMIZATION) (OPTIMIZATION)

1 0.70 0.14 0.02 0.18


2 0.80 0.50 0.64 0.22
3 0.45 0.15 0.10 0.27
4 0.14 0.14 0.26 0.21
5 0.74 0.91 0.46 0.64
Average time for encryption(normal ecc) 0.566 sec
Average time for encryption(optimization) 0.290 sec

Average time for decryption(normal ecc) 0.368 sec

Average time for decryption(optimization) 0.304 sec


The project provides an approach to optimize the
existing Elliptic curve cryptography and make it very
handy and efficient to be deployed in each and every
arena possible
 Hankerson, D., Menezes, A., and Vanstone, S. (2004) “Guide to
Elliptic Curve Cryptography”, Springer.

 William Stallings (2005), “Cryptography and Network Security


Principles and Practices”, Fourth Edition, Prentice Hall.

 Elliptic Curve Cryptography By Certicom Research Center,


(www.certicom.com).

You might also like