Performance evaluation of RSA and Elliptic Curve Cryptography

Singh, Shailendra; Khan, Ajoy Kumar; Singh, Soram Rakesh

doi:10.1109/ic3i.2016.7917979

Cited by 34 publications

(28 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…One major operation ECPM uses 0.81s using 160 bits elliptic curve [25] and RSA 1024 bits M-Exp takes 22 seconds [26]. DES encryption and decryption execution time [27] is same which 4.543859 seconds. We calculate the computation cost of our scheme in comparison with the [8], [12] on the basis of the results of [23], [24], [26]- [28].…”

Section: A Computational Costmentioning

confidence: 91%

Efficient Key Agreement and Nodes Authentication Scheme for Body Sensor Networks

Iqbal¹,

Amin²,

Umar³

et al. 2017

ijacsa

View full text Add to dashboard Cite

Abstract-Technological evolvement of Wireless SensorNetworks (WSNs) gave birth to an attractive research area for health monitoring called Body Sensor Network (BSN). In BSN tiny sensor nodes sense physiological data of patients under medical health care and transmit this data to Base Station (BS) and then forward to Medical Server (MS). BSN is exposed to security threats due to vulnerable wireless channel. Protection of human physiological data against adversaries is a major addressable issue while keeping constrained resources of BSN under consideration. Our proposed scheme consists of three stages. In first stage deployment of initial secret key by the ward Medical Officer (MO), in second stage secure key exchange and node authentication, in third stage secure data communication are performed. We have compared our proposed scheme with three existing schemes. Our scheme is efficient in computation cost, communication overhead and storage as compared to existing schemes while providing enough security against the adversaries.

show abstract

Section: A Computational Costmentioning

confidence: 91%

Efficient Key Agreement and Nodes Authentication Scheme for Body Sensor Networks

Iqbal¹,

Amin²,

Umar³

et al. 2017

ijacsa

View full text Add to dashboard Cite

show abstract

“…(i) A secure elliptic curve ( ) is defined over a finite field , where is a large prime number such that the number is greater than 283 bits; that is, a 283-bit key in ECC is considered to be as secured as 3072-bit key in RSA [43,44]. Next, an order will be selected, together with the base point on the elliptic curve ( ), and the proper choice satisfies ⋅ = , where is the point at infinity.…”

Section: Initial Setup and Registration Phasementioning

confidence: 99%

An ECC-Based Blind Signcryption Scheme for Multiple Digital Documents

Tsai

2017

Security and Communication Networks

View full text Add to dashboard Cite

The popularity of the Internet has comprehensively altered the traditional way of communication and interaction patterns, such as e-contract negotiations, e-payment services, or digital credential processes. In the field of e-form systems, a number of studies investigate the ability of the blind signature to fulfill the basic properties of blindness and untraceability. However, most literatures exploring the blind signature mechanisms only address research and technology pertaining to single blind signature issues. Further, most of the topics only deal with signing rather than encryption. Thus, we propose a new blind signature scheme for multiple digital documents based on elliptic curve cryptography (ECC). Our scheme incorporates the design of signcryption paradigm into the blind signature scheme to strengthen high levels of security. This innovative method also enhances computational efficiency during processing multiple electronic documents since the ECC provides a shorter key length and higher processing speed than other public-key cryptosystems on equivalent secrecy. The analysis results show that the present scheme achieves better performance at low communication overheads as well as with higher level of security. By helping the design of the intrinsic properties, the proposed cryptosystem can be applied to many areas to protect sensitive data in ubiquitous computing environments.

show abstract

“…Table 2 Comparison of key generation time and Table 3 Comparison of signature generation time Table 2 depicts the comparison of key generation time of RSA and ECC schemes [20]. By varying the key length from 1024 to 15,360 bits, the time required for key generation increases linearly.…”

Section: Rsa Vs Eccmentioning

confidence: 99%

“…Elliptic curve cryptosystems also are more computationally efficient RSA and Diffie-Hellman. The computation time of ECC is less when compared to RSA and Diffie Hellman, but it is more complex to implement [20]. RSA and Diffie-Hellman algorithms dominate public-key cryptography and have proved its efficiency in real-world applications.…”

Section: Rsa Vs Eccmentioning

confidence: 99%

See 1 more Smart Citation

Survey on Public Key Cryptography Scheme for Securing Data in Cloud Computing

Athena¹,

Sumathy²

2017

View full text Add to dashboard Cite

Numerous advancements in the Information Technology (IT) require the proper security policy for the data storage and transfer among the cloud. With the increase in size of the data, the time required to handle the huge-size data is more. An assurance of security in cloud computing suffers various issues. The evolution of cryptographic approaches addresses these limitations and provides the solution to the data preserving. There are two issues in security assurance such as geographical distribution and the multi-tenancy of the cloud server. This paper surveys about the various cryptographic techniques with their key sizes, time required for key/signature generation and verification constraints. The survey discusses the architecture for secure data transmissions among the devices, challenges raised during the transmission and attacks. This paper presents the brief review of major cryptographic techniques such as Rivest, Shamir Adleman (RSA), Dffie Hellman and the Elliptic Curve Cryptography (ECC) associated key sizes. This paper investigates the general impact of digital signature generation techniques on cloud security with the advantages and disadvantages. The results and discussion section existing in this paper investigate the time consumption for key/signature generation and verification with the key size variations effectively. The initialization of random prime numbers and the key computation based on the points on the elliptic curve assures the high-security compared to the existing schemes with the minimum time consumption and sizes in cloud-based applications.

show abstract

Performance evaluation of RSA and Elliptic Curve Cryptography

Cited by 34 publications

References 3 publications

Efficient Key Agreement and Nodes Authentication Scheme for Body Sensor Networks

Efficient Key Agreement and Nodes Authentication Scheme for Body Sensor Networks

An ECC-Based Blind Signcryption Scheme for Multiple Digital Documents

Survey on Public Key Cryptography Scheme for Securing Data in Cloud Computing

Contact Info

Product

Resources

About