T. Johnson · NC Digital Online Collection of Knowledge and Scholarship (The University of North Carolina at Greensboro) · 2021
Elliptic curve cryptography has been a remarkable development in the history of cryptography thanks to the properties provided by the implementation of elliptic curve cryptography. Elliptic curve cryptography has proven to be adaptable given its broad presence across various electronics of diering sizes and capabilities. Elliptic curve cryptography is known for utilizing the discrete logarithm problem, modern algebra, and elliptic curves that have encouraged continued research into elliptic curve cryptography in its advantages and restrictions. The current comprehension of elliptic curves as well as continuing advancements and employments of elliptic curve cryptography have yielded the elliptic curve digital signature algorithm (ECDSA) which has become an alternative to the primary Digital Signature Algorithm. TheECDSA provides advantages of elliptic curve cryptography to the function of the digital signature algorithm to authenticate and protect transmissions between involved parties. Such can be explored in the securing of bitcoinrelated transactions where the completely electronic, decentralized currencywould face a multitude of cyber threats and require safeguards to remaintrustworthy.
Cited by 35
Sakshi Chauhan, Nidhi Gulati · 2016
Cited by 2
2015
(ECDSA) is the elliptic curve analogue of the Digital Signature Algorithm (DSA). Unlike the ordinary discrete logarithm problem elliptic curve discrete logarithm problem (ECDLP) has no sub-exponential time algorithm, due to this the strength per key bit is substantially greater when compare with conventional discrete logarithm systems. Elliptic curve based digital signatures are stronger and ideal for constrained environments like smart cards due to smaller bit size, thereby reducing processing overhead. Considering the security of data it is lacking regarding random number choosing or determination. This lacking leads to recovery of the private key in original Elliptic Curve Digital Signature scheme. This problem is overcome by our proposed digital signature scheme which is presented in this paper.
Cited by 0
Junru Hu · 2011
ECDSA is the first successful algorithm that based on ECC. It was accepted by ANSI, IEEE, NIST and ISO as the standard signature algorithm. In this paper, ECDSA was analyzed and improved. The improved algorithms reduce the computational cost while keeping the same security as original ECDSA. They are suitable for the users who have limited compute capacity in different cases. The performance data of each algorithm was presented also.
Cited by 23
Hung-zih Liao, Yuan-yuan Shen · 2006
In this thesis, we propose a variant of the ANSI X9.62 ECDSA. We give a brief introduction to the digital signature algorithm in chapter 2, and then give the basic concepts of the elliptic curve cryptosystems in chapter 3. The next chapter includes the elliptic curve version of DSA, and finally a variant of ECDSA will be given in chapter 5. 1
Cited by 0
Don B. Johnson, Alfred Menezes, Scott A. Vanstone · International Journal of Information Security · 2001
Cited by 2,165
İsmail Bütün, Mehmet Demirer · TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES · 2013
In this study, we propose a blind digital signature (BDS) scheme based on the elliptic curve digital signature algorithm that increases the performance significantly. The security of our scheme is based on the difficulty of the elliptic curve discrete algorithm problem. Therefore, it offers much smaller key lengths for the desired security levels, along with much faster cryptographic processes, leading to fewer hardware and software requirements. According to our simulation results, the relative performance improvement of our proposed BDS scheme is up to 96% when compared with previously proposed schemes.
Cited by 13Open access
Cheng Deng-feng · 2008
Some elliptic curve digital signature and verify algorithms are proposed according to signing equation,the format of kP±lQ is adopted in these algorithms,and scalar multiplication is subtly diminished once.ECDSA(elliptic curve digital signature algorithm) is regarded as the world standard elliptic curve signature algorithm,and there are some other related signature algorithms,likewise the format of kP±lQ is adopted in all these algorithms,and scalar multiplication should be done twice.These algorithms presented by this paper cost only half time of ECDSA in the process of verify just because scalar multiplication is the key and other operation time is ignored,then some experiments are done to verify.
Cited by 2
HUI HE · 2023
With the progress of the times, the concept of the quantum computer has been put forward. Encryption algorithms developed based on the discrete logarithm problem are also facing more and more challenges, However, the Elliptic Curve Digital Algorithm (ECDSA) used by bitcoin is an encryption algorithm developed based on the discrete logarithm problem. Therefore, the author wants to design a method that can prevent the password from being quickly cracked by the quantum computer and can also be compatible with the original encryption algorithm system to reduce the maintenance cost of updating the encryption system. For the two points of appeal, the author thought of improving the original encryption algorithm ECDSA. In this work, secondary random encryption on cQ through the randomness of signature is performed to improve ECDSA. The improved ECDSA encryption algorithm is not an asymmetric algorithm. This is a combination of two encryption algorithms. The combination of asymmetric and symmetric algorithms makes it difficult for quantum computers to crack. If the attacker does not know which algorithm to use, he may be forced to conduct violent attacks, which greatly increases the difficulty of cracking the original algorithm. At present, the author has realized the improvement of ECDSA, and can re-encrypt the original asymmetric ECDSA encryption algorithm so that it does not belong to the asymmetric algorithm. In this way, the security of the huge cryptocurrency market can be further guaranteed, and the algorithm can be greatly compatible with the cryptocurrency system using ECDSA as the encryption algorithm.
Cited by 0
P. Hoffman, Wouter C. A. Wijngaards · 2012
This document describes how to specify Elliptic Curve Digital Signature Algorithm (DSA) keys and signatures in DNS Security (DNSSEC). It lists curves of different sizes and uses the SHA-2 family of hashes for signatures.
Cited by 29Open access
Shweta Lamba, Monika Sharma · 2013
In recent years, Elliptic Curve Cryptography (ECC) has attracted the attention of researchers and product developers because of its robust mathematical structure and highest security in comparison to other existing algorithms like RSA (Rivest Adleman and Shameer Public key Algorithm). Elliptic Curve Digital signature represents one of the most widely used security technologies for ensuring un-forge-ability and non-repudiation of digital data. Its performance heavily depends on an operation called point multiplication. Furthermore, root cause of security breakdown of ECDSA is that it shares three points of the elliptic curve public ally which makes it feasible for an adversary to gauge the private key of the signer. In this paper we proposed a new ECDSA which involves not as much of point multiplication operations as in existing ECDSA and shares only two curve points with everyone. The proposed method also reduces the point addition and point doubling operations. It is found to be more secure in contrast to existing ECDSA.
Cited by 29
Mohan Chintamani, Prabal Paul, Laba Sa et al. · International Journal of Information Technology · 2024
Cited by 1
Mustafa Hussien Mohamed, Wageda I. El Sobky, Sara Hamdy · International Journal of Innovative Technology and Exploring Engineering · 2021
This paper try to introduce the advantages and disadvantages of the Elliptical Curve Digital Signature Algorithm that could be put in consideration for future usage through applications and future scalability depending on improvement levels of elliptical curve Digital Signature Algorithm starting from The elliptical Curve Cryptography that it was extracted from till showing, elliptical curve Digital Signature Algorithm's security power, performance quality, memory usage rate, applications, challenges, and last improvement. To help in the future in evading some problems like forgery, worse usage of memory because of big sized keys that cause the need for high processing power that reduces the performance quality, and considering it as a level in a new algorithm to reduce the tries of attacking and hacking specific messages between specific parties, after explaining the Elliptical Curve Cryptography and how the scientists reached from the Elliptical Curve Cryptography to the Elliptical Curve Digital Signature Algorithm and why they developed Elliptical Curve Digital Signature Algorithm, the paper will explain its advantages and disadvantages of the Elliptical Curve Digital Signature Algorithm, then the paper will explain what is the differences happen in a new type of the Elliptical Curve Digital Signature Algorithm called Multiple Elliptical Curve Digital Signature Algorithm, trying to show what is the improvement stages was happened in the Elliptical Curve Digital Signature Algorithm, how that affected the nowadays applications, and how that participated in improving the security performance and increasing the security strength, there fore what was included in the paper could be used as a nucleus for more and more improving of the Elliptical Curve Digital Signature Algorithm, and evading its defects.
Cited by 12Open access
Nissa Mehibel, M. Hamadouche · Journal of Discrete Mathematical Sciences and Cryptography · 2019
Elliptic Curve Digital Signature Algorithm (ECDSA) is a public key cryptographic algorithm based on the hardness of the Elliptic Curve Discrete Logarithm Problem (ECDLP), it is used to ensure users’ authentication, data integrity and transactions non-repudiation. However, its weakness is to derive the signer’s private key in case he uses the same random number for to generate two signatures for two different messages. Firstly, in this paper we present the ECDSA and analyse its variants proposed in the literature.Also, we propose a new improvement technique for ECDSA of Liao and Shen and ECDSA of Chande and Lee. We intend to do so by introducing the unknown parameters which are used in the verification of the signature. Our aim is to overcome the problem which has not been explained in ECDSA schemes of both Liao and Shen and Chande and Lee.
Cited by 26
Lawrence E. Bassham Iii · 2004
Cited by 0
Than, Myint Myint, Soe, Yee Yee · 2010
Multi signature schemes provide dataauthenticity integrity, and non repudiation. Theproposed signing and verifying schemes areextensions of standardized algorithms ECDSA(Elliptic Curve Digital Signature Algorithm).These schemes are faster than repeated E CDSA( RECDSA). ECDSA schemes can be dire ctly usedin many applications, such as E Business for ajoint signature of a contract between two or moreorganizations, or E Government. The final multisignature of a message can be verifiedindividually for each signer or collectively for asubgroup or entire group as well.
Cited by 0
Thomas Pornin · 2013
This document defines a deterministic digital signature generation procedure.Such signatures are compatible with standard Digital Signature Algorithm (DSA) and Elliptic Curve Digital Signature Algorithm (ECDSA) digital signatures and can be processed with unmodified verifiers, which need not be aware of the procedure described therein.Deterministic signatures retain the cryptographic security features associated with digital signatures but can be more easily implemented in various environments, since they do not need access to a source of high-quality randomness.
Cited by 130
Srinivasulu Pathakamuri, B.V. Ramana Reddy, Abhishek Kumar · International Journal of Engineering and Advanced Technology · 2019
Cloud computing usage has been highly increased in past decades, and this has many features to effectively store, organize and process the data. The major concern in the cloud is that security is low and user requires verification process for the data integrity. Third Party Auditing (TPA) technique is applied to verify the integrity of data and various methods has been proposed in TPA for effective performance. The existing methods in TPA has the lower performance in communication overhead and execution time. In this research, Elliptic Curve Digital Signature (ECDS) is proposed to increase the efficiency of the TPA. Bilinear mapping technique is used for verification process without retrieving the data and this helps to reduce the communication overhead. The performance of ECDA is measured and compared with the existing method to analyze the performance.
Cited by 1Open access
AMOUNAS, FATIMA, EL KINANI, EL HASSAN · Indonesian Journal of Electrical Engineering and Computer Science · 2012
Cited by 3Open access
Aditya Kumar, Bhupinder Kaur · 2021
The Wireless Sensor Network (WSN) has an evolving technology and is able to be used in critical situation such as commercial applications like traffic surveillance, buildings, smart homes and habitat monitoring, etc. One of the biggest challenges today for wireless sensor networks is security. Wireless Sensor Networks (WSN) security models required the following services like integrity and authentication and confidentiality. A well-designed cryptographic algorithm is the secret to developing a riskless WSN scheme in order to fulfil the requirement for sensor nodes with less resource and low power consumption. Public-key cryptography algorithm, namely elliptical curve cryptography (ECC) & elliptic curve digital signature algorithm (ECDSA), have attracted interest from the many researchers in various institutions because of the security and high performance of these algorithms. Algorithms based on the elliptical curve (EC) have proved computationally efficient and provide more security in comparison to traditional crypto-algorithms in the specified key size. ECDSA is first successful ECC- based algorithm. This paper includes descriptions of ECDSA using the SHA-l. We analyse and propose a improve ECDSA algorithm. The main objective of this improved algorithm is to be provide more security as compared to previous algorithm.
Cited by 6