On some digital signature schemes based on factoring and discrete logarithm

• Main Authors: Ko, Kara Jan Vincent D., Untivero, Reggine G.
• Format: text
• Language: English
• Published: Animo Repository 2016
• Subjects: Logarithms; Digital signatures; Data encryption (Computer science); Authentication; Factorization (Mathematics); Mathematics
• Online Access: https://animorepository.dlsu.edu.ph/etd_bachelors/14903
• Institution: De La Salle University

Due to the constant development of technology, Whitfield Diffie and Martin Hellman [3] started the concept of digital signatures which enables the sender and recipient to put signatures on electronic documents. The problem with digital signatures is that it is still prone to attacks that are based on mathematical principles. These lead to certain forgeries when an adversary computes the signer's private key allowing generation of fake signatures in any message. This paper tackles some digital schemes that are included in the papers of Verma and Sharma [18] tackling the merits of the schemes of He and Keisler [8] and Shimin Wei [19], which are based on the difficulty of solving factoring and discrete logarithm problems. With this, the authors made a modification on one of the parameters of Verma and Sharma's scheme after checking and studying the schemes of the other papers [8, 19] as well as studying the mathematical concepts of digital signatures.