Computational Cost Analysis of Elliptic Curve Arithmetic

Atay,; Koltuksuz,; Hisil,; Eren,

doi:10.1109/ichit.2006.253548

Cited by 3 publications

(2 citation statements)

References 6 publications

(8 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In fact, there are a lot of work on speeding the points multiplication and so making the ECC more efficient. For more information about the various points representations and points multiplication algorithms, see [5][6][7][8].…”

Section: A Efficiency Analysismentioning

confidence: 99%

Mutual Authentication Scheme for Muliti-server Environment Without Using Smart Cards

Wang¹,

Deng²

2012

Proceedings of 2012 National Conference on Information Technology and Computer Science

View full text Add to dashboard Cite

To authenticate a remote user over an insecure channel, which widely deployed in e-commerce, e-government, information security, business management and many more, we propose a scheme without using smartcards. Due to the elliptic curve discrete logarithm problem, the proposed scheme is safe and efficient. Moreover, it achieves the following merits: no verification table, user friendly property, mutual authentication, no time-synchronization problem, suitable for multi-server environment and simple storage device.

show abstract

Section: A Efficiency Analysismentioning

confidence: 99%

Mutual Authentication Scheme for Muliti-server Environment Without Using Smart Cards

Wang¹,

Deng²

2012

Proceedings of 2012 National Conference on Information Technology and Computer Science

View full text Add to dashboard Cite

show abstract

“…It is essential to rise the number of bits required in the RSA generated key pairs than in the ECC generated key pairs [3] [4], to maintain the same degree of security in view of rising computer power. The variations in the key sizes between ECC [5][6] [7] and RSA will grow exponentially to maintain the same relative strength as compared to the average computing power available [8]. Due to the complexity in the point addition and point doubling [9][10] the encryption and decryption process in ECC are very slow [11] [12].…”

Section: Introductionmentioning

confidence: 99%

Performance Evaluation of Sextic Curve Cryptography and Probability Symmetric Curve Cryptography in Wireless Sensor Networks

Emmanuel¹

2013

IJCA

View full text Add to dashboard Cite

This paper starts with a brief introduction of the different coordinate systems prevailing in cryptography, aims in developing security measures which could save atleast some amount of time in the execution processes. For this purpose the sextic curve and the probability symmetric curve are considered. Simulation exercises are carried out for both and it is proved that in both the cases the time taken for encryption and decryption is slightly lesser than that for RSA and ECC. On the whole this study brings out the new system for encryption and decryption with higher level of secrecy and lesser amount of time. General TermsCryptography, Security.

show abstract

Mutual Authentication for Wireless Communication Using Elliptic Curve Digital Signature Based on Pre-known Password

Roy¹,

Sisodia²,

Upadhyay³

et al. 2012

Advances in Computing and Information Technology

View full text Add to dashboard Cite

Computational Cost Analysis of Elliptic Curve Arithmetic

Abstract: Abstract

Cited by 3 publications

References 6 publications

Mutual Authentication Scheme for Muliti-server Environment Without Using Smart Cards

Mutual Authentication Scheme for Muliti-server Environment Without Using Smart Cards

Performance Evaluation of Sextic Curve Cryptography and Probability Symmetric Curve Cryptography in Wireless Sensor Networks

Mutual Authentication for Wireless Communication Using Elliptic Curve Digital Signature Based on Pre-known Password

Contact Info

Product

Resources

About