Ijaerv12n19 140
Ijaerv12n19 140
Ijaerv12n19 140
9053-9061
© Research India Publications. http://www.ripublication.com
Dindayal Mahto
Department of Computer Applications, National Institute of Technology Jamshedpur,
Adityapur, Saraikella-Kharsawan, Jharkhand, India.
9053
International Journal of Applied Engineering Research ISSN 0973-4562 Volume 12, Number 19 (2017) pp. 9053-9061
© Research India Publications. http://www.ripublication.com
For better and stronger security of data, bigger key sizes y2 = x3 + ax + b (1)
require, which means more overhead on the computing where, 4a3 + 27b2 ≠ 0.
9054
International Journal of Applied Engineering Research ISSN 0973-4562 Volume 12, Number 19 (2017) pp. 9053-9061
© Research India Publications. http://www.ripublication.com
ECC is other promising asymmetric key cryptosystems, An Illustration of Elliptic Curve Cryptography
independently coined by Miller [10] and Koblitz [11] in the
This illustration presents a data communication security
late 1980s. This type of systems is most suitable for memory
model for a message of 64-bits using ECC.
constraint devices such as Palmtop, Smartphone, Smartcards,
etc. An ECC requires comparatively less or smaller
parameters for encryption and decryption than RSA, but with
Key Exchange using Elliptic Curve Diffie-Hellman
equivalent levels of security.
Algorithm [12]
---------------------------------------------------------------------------
ECC Algorithm
Here, global parameters of ECC are:
---------------------------------------------------------------------------
Global Public Elements
Step I. Eq(a, b) elliptic curve with parameters a, b, and q, Prime number q=8209, a=2, b=7, G=(4, 1313), h=1% of
where q is a prime or integer of the form 2 m. secret key (ie.K(x)), for encoding and decoding of message in
elliptic curve. Based on global parameters, the elliptic curve’s
Step II. G point on elliptic curve whose order is large value n equation becomes:
= Pm + k(nBG) - nB (kG)
--------------------------------------------------------------------------- Step VI. Calculation of secret-key by Bob is:
Here, Pm is a (x,y) point encoded with the help of plaintext K(x, y) = dB * PA
message ‘m’. The Pm is the point used for encryption and
decryption. = 4802 * (7926, 5458)
= (1846, 3967)
9055
International Journal of Applied Engineering Research ISSN 0973-4562 Volume 12, Number 19 (2017) pp. 9053-9061
© Research India Publications. http://www.ripublication.com
In this way, both parties get same secret key i.e. Table 3: Cipher points in the elliptic curve
K(x, y) = (1846, 3967). The variable ‘h’ gets rounded value of
1% of K(x) = 18. Cmsg(X) Cmsg(y)
2716 8156
2729 736
Encryption of plain message by Alice (Sender)
2606 515
Steps for encryption 5065 1924
Step I. Alice generates plain message as: ‘32148765’ 4675 7807
Step II. Encoding: 1806 6837
Alice encodes the plain message into encoded message points 3427 896
in the elliptic curve as shown in Table 2 and in the Figure 2. 6647 6331
9056
International Journal of Applied Engineering Research ISSN 0973-4562 Volume 12, Number 19 (2017) pp. 9053-9061
© Research India Publications. http://www.ripublication.com
classes from the FlexiProvider library of ECC. The RSA Case Study 2: A Secure and Efficient Remote User
algorithm used in the comparison is the FlexiProvider Authentication Scheme for Multi-server Environments Using
implementation. Performance evaluation of the three ECC by Zhang, Junsong, et al. [13]
algorithms based on the time lapse for their key generation,
The requirements of operations are lesser in ECC-based than
encryption, and decryption algorithms, and encrypted data
other related asymmetric-key schemes, in turn, it requires a
size was carried out and compared. The results show that
less computational cost. The demonstration of the paper
their elliptic curve-based implementations are more superior
shows that proposed scheme can solve various types of
to the RSA algorithm on all corresponding parameters.
security problems and is better suitable for memory-
After comparing the RSA and ECC ciphers, it was proved that constrained devices.
ECC involves much fewer overheads compared to RSA. The
ECC has shown to have many advantages due to its ability to
provide the same level of security as RSA yet using shorter Implementing Hardware Security
keys. However, its disadvantage which may even hide its
Case Study 1: Elliptic Curve Cryptosystems by M.J.B.
attractiveness is its lack of maturity, as mathematicians,
Robshaw et al. [14]
believed that enough research has not yet been done in
ECDLP. In their note, they provide a high-level comparison of the RSA
public-key cryptosystem and proposals for public-key
cryptography based on elliptic curves.
There are, however, many issues to consider when making a
choice between applications based on an elliptic curve
cryptosystem and one based on RSA. In their note, they have
presented some of the issues (security, performance,
standards, and interoperability) that are perhaps most pertinent
when making such a choice. The comparisons in this note are
made, however, under the premise that an elliptic curve
cryptosystem over GF(2160) offers the same security as 1024-
bit RSA.
9057
International Journal of Applied Engineering Research ISSN 0973-4562 Volume 12, Number 19 (2017) pp. 9053-9061
© Research India Publications. http://www.ripublication.com
of memory accesses. This algorithm led to a 25% performance consistently outperforms the traditional option represented by
increase for ECC point multiplication on the Atmel AVR RSA in all the scenarios tested. Additionally, their analytical
platform. Their measurements and analysis led to fundamental model predictions show a reasonable agreement with the
observations: The relative performance of ECC over RSA obtained real data. They proposed a model for the protocol
increases as the word size of the processor decreases. It stems analysis considering the processing time of the cryptographic
from the fact that the complexity of addition, subtraction and operations performed in the Client and the Server during the
optimized reduction based on sparse pseudo-Mersenne primes Negotiation protocol.
grows linearly with the decrease of the word size whereas
Montgomery reduction grows quadratically. As a result, ECC
point multiplication on small devices becomes comparable in Comparative Analysis of RSA and ECC
performance to RSA public-key operations, and they expect it
This paper implements RSA and ECC for secrecy of
to be higher for large key sizes.
information with three sample data inputs of 8 bits, 64 bits,
256 bits and random private keys based on the
recommendation of NIST [2]. The experiments are done on
Wireless LAN Security
MATLAB R2008a on Intel Pentium dual-core processor (1.60
Case Study 1: Comparative Performance Analysis of Public- GHz, 533 MHz, 1 MB L2 cache) with 2GB DDR2 RAM
Key Cryptographic Operations in the WTLS Handshake under Ms-Windows platform. The efficiency of ECC over
Protocol by Rodríguez-Henríquez et al. [15] RSA is shown in Table 4-6 and Figure 4-12. Based on
experimentation, it is observed that RSA is very efficient in
In their paper, an efficient realization of the WTLS (Wireless
encryption but slow in decryption while ECC is slow in
Transport Layer Security) handshake protocol was
encryption but very efficient in decryption. Overall ECC is
implemented on a realistic wireless scenario composed of a
more efficient and secure than RSA as shown in the figures
typical mobile device wirelessly connected with a workstation
Figure [6, 9 and 12].
server. The data gathered in their experiments shows that ECC
Input: 8 bits
Encryption Decryption Total Time
Security ECC ECC
Bit Level Enc. RSA Enc. ECC Dec. RSA Dec. Total RSA Total
Time Time Time Time Time Time
80 0.4885 0.0307 1.3267 0.7543 1.8152 0.7850
112 2.2030 0.0299 1.5863 2.7075 3.7893 2.7375
128 3.8763 0.0305 1.7690 6.9409 5.6453 6.9714
144 4.7266 0.0489 2.0022 13.6472 6.7288 13.6962
Input: 64 bits
Encryption Decryption Total Time
Security ECC ECC RSA
Bit Level Enc. RSA Enc. ECC Dec. RSA Dec. Total Total
Time Time Time Time Time Time
80 2.1685 0.1366 5.9099 5.5372 8.0784 5.6738
112 9.9855 0.1635 6.9333 20.4108 16.9188 20.5743
128 15.0882 0.1672 7.3584 46.4782 22.4466 46.6454
144 20.2308 0.1385 8.4785 77.7642 28.7093 77.9027
9058
International Journal of Applied Engineering Research ISSN 0973-4562 Volume 12, Number 19 (2017) pp. 9053-9061
© Research India Publications. http://www.ripublication.com
Table 6: 256 bits – Encryption, Decryption and Total Time (in seconds)
Figure 4: 8 bits – Encryption Time (in seconds) Figure 6: 8 bits – Total (Encryption and Decryption) Time (in
seconds)
9059
International Journal of Applied Engineering Research ISSN 0973-4562 Volume 12, Number 19 (2017) pp. 9053-9061
© Research India Publications. http://www.ripublication.com
Figure 8: 64 bits - Decryption Time (in seconds) Figure 11: 256 bits – Decryption Time (in seconds)
Figure 9: 64 bits - Total (Encryption and Decryption) Time Figure 12: 256 bits – Total (Encryption and Decryption)
(in seconds) Time (in seconds)
CONCLUSION
Security of the message is paramount during its transmission
from one user to another user or system. A cryptographic
technique provides a message security. Symmetric-key
cryptography is very good in providing security to the
message but suffers from key distribution and management
problems. To mitigate the key distribution and management
problems and to ensure confidentiality, and integrity of a
message, asymmetric-key cryptography has been invented by
Diffie-Hellmen [12]. This paper presented a comparative
analysis of RSA and ECC. The experimentation was
conducted for finding time lapse during encryption,
decryption by RSA and ECC on three sample input data of 8
Figure 10: 256 bits – Encryption Time (in seconds) bits, 64 bits, 256 bits with random keys based on NIST
recommendation. Based on experimentation, it was found that
ECC outperforms RSA regarding operational efficiency and
security with lesser parameters. An ECC is particularly most
suitable for resource constraint devises.
9060
International Journal of Applied Engineering Research ISSN 0973-4562 Volume 12, Number 19 (2017) pp. 9053-9061
© Research India Publications. http://www.ripublication.com
9061