Sung‐Ming Yen, Chi‐Sung Laih · IEEE Transactions on Computers · 1995
A digital signature algorithm is developed which is an improved version of the digital signature algorithm (DSA) proposed by the NIST (1991). The security of the improved version is the same as the original one while it benefits the signature signer and performs more efficiently.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cited by 20
Krabbe, Johannes · Zenodo (CERN European Organization for Nuclear Research) · 2025
Cited by 0Open access
Krabbe, Johannes · Zenodo (CERN European Organization for Nuclear Research) · 2025
Cited by 0Open access
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
Taekyoung Kwon · Information Processing Letters · 2002
Cited by 6
Maslia · 2017
Cited by 0
İ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
Anandayu Dyah Paramitasari · 2009
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
Sakshi Chauhan, Nidhi Gulati · 2016
Cited by 2
Dimitrios Poulakis · Designs Codes and Cryptography · 2008
Cited by 11
C. Zhang, Yuan Liu, Faqiang Leng et al. · 2024
Cited by 0
Prajwal Hegde N., V. Veena Devi Shastrimath · International Journal of Advanced Computer Science and Applications · 2023
Security is one of the most important issues in layout of a Digital System. Communication these days is digital. Consequently, utmost care must be taken to secure the information. This paper specializes in techniques used to defend the facts from thefts and hacks the use of quit-to-cease encryption and decryption. Cryptography is the important thing technique related to Encrypting and Decrypting messages. We use Digital Signature preferred (DSS) and the Digital Signature Algorithm (DSA). The code for this algorithm is written in MATLAB. The DSA Algorithm is commonly used in cryptographic applications to provide services such as entity authentication, key transit, and key agreement in an authenticated environment. This structure is related with steady Hash Function and cryptographic set of rules the government groups in USA as it is taken into consideration to be one of the safest approaches of protection system. This fashion- able could have a top notch effect on all of the Government Agencies and Banks for protective the facts.
Cited by 3Open access
Hiep L. Thi · Smart innovation, systems and technologies · 2026
Cited by 0
Hamza A. A. Al-Sewadi, Ruqa A. Al-Shnawa, Mohammed M. Rifaat · 2021
Although many digital signature algorithms are available nowadays, the speed of signing and/or verifying a digital signature is crucial for different applications. Some algorithms are fast for signing but slow for verification, but others are the inverse. Research efforts for an algorithm being fast in both signing and verification is essential. The traditional GOST algorithm has the shortest signing time but longest verification time compared with other DSA algorithms. Hence an improvement in its signature verification time is sought in this work. A modified GOST digital signature algorithm variant is developed improve the signature verification speed by reducing the computation complexity as well as benefiting from its efficient signing speed. The obtained signature verification execution speed for this variant was 1.5 time faster than that for the original algorithm. Obviously, all parameters' values used, such as public and private key, random numbers, etc. for both signing and verification processes were the same. Hence, this algorithm variant will prove suitable for applications that require short time for both, signing and verification processes. Keywords— Discrete Algorithms, Authentication, Digital Signature Algorithms DSA, GOST, Data Integrity
Cited by 3
Yanshuo ZHANG, Ning LIU, Yuqi YUAN et al. · SHILAP Revista de lepidopterología · 2023
The adapter signature scheme can provide good properties of atomic exchange in the block chain, and has been widely used in practice.A new adapter signature scheme was constructed based on a digital signature algorithm for improved security of RSA cryptosystem (ISRSAC).After proving that the proposed scheme satisfied the correctness of the pre-signature, unforgeability, adaptability of the pre-signature, extractability of the evidence and the security of the signature scheme, it was compared with the adapter signature scheme based on the SM2 digital signature algorithm, the Schnorr-based adapter signature scheme and the ECDSA-based adapter signature scheme.And these schemes were analyzed in terms of time overhead and main calculation amount.The analysis results show that the proposed scheme is similar to other schemes in terms of time overhead, but the proposed scheme expands the application scenarios of ISRSAC algorithm in the current environment, and through the combination of ISRSAC algorithm and adapter signature technology, the selection of adapter signature is more flexible and can have a wider range of applications.
Cited by 2Open access
Xu Xinyue, Xu Shujiang, Wang Lianhai et al. · SHILAP Revista de lepidopterología · 2026
Adaptor signature can guarantee the atomicity of cross-chain transactions without relying on trusted third parties, but most adaptor signature algorithms fail to protect the privacy of user identities. Moreover, most of these schemes are not based on domestic cryptographic algorithms, resulting in poor autonomy and controllability. To address these issues, a ring adaptor signature scheme based on the SM2 digital signature algorithm was proposed. The signer first generates a pre-signature using a ring signature; after the pre-signature is verified, it is combined with a secret value to adapt to a complete signature; any user with the pre-signature and its complete signature can extract the secret value. This ring adaptor signature scheme uses the properties of ring signatures to protect the privacy of the signer's identity in the pre-signature stage, while using adaptor signatures to ensure the atomicity of transactions, and combines the excellent characteristics of both identity privacy protection and transaction atomicity. Its security can be reduced to the discrete logarithm problem. Under the random oracle model, it was proved that the proposed scheme satisfies pre-signature adaptability, pre-signature correctness, existential unforgeability under chosen message attacks, witness extractability, and anonymity. Theoretical analysis shows that the time and communication overhead of this ring adaptor signature scheme is comparable to that of existing ring adaptor signature schemes. This scheme greatly expands the application of domestic cryptographic signature algorithms in the field of ring adaptor signatures, which is especially pertinent to the field of privacy protection in cross-chain payments.
Cited by 0Open access
Mohan Chintamani, Prabal Paul, Laba Sa et al. · International Journal of Information Technology · 2024
Cited by 1
Nur Cholik Hasyim · 2010
Tandatangan digital digunakan untuk mendeteksi modifikasi terhadap suatu informasi dari pihak yang tidak berwenang dan untuk mengetahui keaslian identitas penandatangan. Sebagai tambahan, penerima data yang telah di tandatangani dapat menggunakan tandatangan digital untuk membuktikan kepada pihak ketiga bahwa data tersebut telah di tandatangani oleh si penandatangan. Ini di sebut sebagai bebas penyangkalan karena penandatangan tidak bisa pada lain waktu untuk mengingkari tandatangan tersebut. Ada tiga algoritma tandatangan digital yang disebutkan dalam FIPS-182 tentang Digital Signature Standard, algoritma yang pertama, Digital Signature Algorithm (DSA). Algoritma yang kedua, Rivest, Shamir and Adleman (RSA) algoritma. Dan yang ketiga yaitu Elliptic Curve Digital Signature Algorithm (ECDSA). Pada Skripsi ini akan dibahas algoritma pembuatan dan verifikasi tandatangan digital dengan menggunakan Digital Signature Algorithm (DSA) dan juga implementasinya dengan menggunakan bahasa pemrograman Java. Keyword : Tandatangan Digital, Kriptografi Kunci Publik, Keamanan Sistem Informasi. Related Link : http://skripsi.umm.ac.id/files/disk1/79/jiptummpp-gdl-s1-2005-nurhasyim9-3907-pendahul-n.pdf
Cited by 0
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