Implementing Discrete Logarithm based Digital Signature Schemes
A. B. Nimbalkar, Chitra G. Desai · 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 perceptions.