An efficient digital signature scheme by using integer factorization and discrete logarithm problem

Shailendra Kumar Tripathi, Bhupendra Gupta · 2017

In this paper, a new probabilistic digital signature scheme (PDSS) is proposed by using two dissimilar cryptographic assumptions; integer factorization (IF) and discrete logarithm (DL) problems. The use of these two dissimilar cryptographic assumptions together enhances the security of the PDSS and makes secure from forgery and basic attacks as well as increases the efficiency.

Read the paper · More papers on PaperTik