Developing Digital Signature Schemes Based on Discrete Logarithm Problem (original) (raw)
Related papers
A Design Method of Digital Signature Scheme Based on Discrete Logarithm Problem
IJCSNS International Journal of Computer Science and Network Security, VOL.17 No.2, February 2017, 2017
This paper proposes a design method of digital signature schemebased on the difficulty of the discrete logarithm problem. Withthe proposed method, we can develop a lot of other digitalsignature schemes to choose suitable for practical applications.
A New Digital Signature Scheme Based on Integer Factoring and Discrete Logarithm Problem
International Journal of Computers and Their Applications, 2010
A new idea for digital signature scheme is suggested. The suggested scheme employs a composite modulus that is a product of two distinct prime numbers. There is a similarity with the most widely used digital signature schemes such as RSA regarding the algebraic background. The new scheme uses operations in prime integer order, a characteristic that is similar to Digital Signature Standard ( DSS ) scheme. Thus the proposed signature scheme is deterministic. The new scheme is competitive and more efficient in time complexity compared with DSS and RSA schemes regarding measurement over both key generation and key verification.
Implementing Discrete Logarithm based Digital Signature Schemes
2012
A digital signature is a cryptographic method for verifying the identity of an individual, a process, computer system, or any other entity, in much the same way as a handwritten signature verifies the identity of a person. Digital signatures use the properties of public-key cryptography to produce pieces of information that verify the origin of data. Several digital schemes have been proposed as on date based on factorization, discrete logarithm and elliptical curve. However, the Pollard rho and the baby-step giant-step Algorithm digital scheme based on discrete logarithm gained wide acceptance. Many schemes followed there by with little changes in it. Some of the schemes evolved by combing factorization and discrete logarithm together making it difficult for solving two hard problems from the hackers point of view. This paper presents the implementation of Pollard rho and the baby-step giant-step algorithm, with the help different tools and further analyzed them for different perce...
A new digital signature scheme based on factoring and discrete logarithms
International Journal of Computer Mathematics, 2004
This article proposes a new digital signature scheme based on the difficulty of simultaneously factoring a composite number and computing discrete logarithms. In the proposed scheme, each user uses common arithmetic moduli and only owns one private key and one public key. Furthermore, some possible limitations have been analyzed, but none of them can successfully overrule the proposed scheme.
Asymmetric Key Cryptosystem and Digital Signature Algorithm Built on Discrete Logarithm Problem (DLP
Springer, 2018
The thoughts of data security prompt the advancement of Cryptography. At the end of the day, Cryptography is investigation of keeping data secure. In the advanced mark plot a message can be "marked" utilizing a secretly held decoding key. Anybody can confirm this mark utilizing the comparing freely uncovered encryption key. Marks can't be fashioned, and an endorser can't later prevent the legitimacy from claiming his mark. This has evident applications in "electronic mail" and "electronic assets exchange" frameworks. Cryptography, notwithstanding give secrecy, authenticity, integrity and non-revocation. The core of cryptography lies in the keys included and mystery of the keys used to encode or decode. Another vital issue is the key size that determines the strength of the key and complexity in executing brute force attack on the texts to recover the key. There have been different cryptographic algorithms suggested. And we give brief overview of mathematical back ground of public key cryptography. A novel the public key scheme and cryptographic signature system has been proposed and the security of system relies on difficulty of computing discrete logarithm problem over finite field.
International Journal of Computer Applications, 2013
A digital signature is a cryptographic method for verifying the identity of an individual. It can be a process, computer system, or any other entity, in much the same way as a handwritten signature verifies the identity of a person. Digital signatures use the properties of public-key cryptography to produce pieces of information that verify the origin of the data. Several digital schemes have been proposed as on date based on factorization, discrete logarithm and elliptical curve. However, the Swati Verma and Birendra Kumar Sharma [8] digital signature scheme which combines factorization and discrete logarithm together making it difficult for solving two hard problems from the hackers point of view. This paper presents the implementation of same, with the help of different tools and further analyzes them from different perceptions.
New ID-based digital signature scheme on factoring and discrete logarithms
The past years have seen many attempts to construct identity based signature schemes on a single hard problem, like factoring or discrete logarithms. But in the near future, those systems will no longer be secure if the solution of factoring or discrete logarithms problems is discovered. In this paper, we propose a new identification-based signature scheme on factoring (FAC) problem and discrete logarithms (DL) problems. Having concatenated FAC and DL hard problems, the presented scheme has solid structure and will hopelessly leave the eavesdropper baffled. The performance analysis has been given to describe the proposed scheme in terms of security level. In addition, the scheme protects the signer from chosen-message attack and also identifies a forged signature. At the moment, no malicious attacks are capable of “breaking” this scheme in a reasonable amount of time obviously. We also show that the performance of the scheme requires only minimal operation both in signing and verify...