A New Digital Signature Scheme Based on Integer Factoring and Discrete Logarithm Problem
Mustafa A. Al-Fayoumi, Sattar J. Aboud, Mohammad Al-Fayoumi · Int. J. Comput. Their Appl. · 2010
Abstract 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. Key Words : Public-key cryptography, RSA Signature scheme, DSS scheme, integer factoring, discrete logarithm problem 1 Introduction The most widely used digital signature schemes today are based on either factoring of modulus, which is the product of two large prime numbers or the difficulty of solving discrete logarithm problem. For instance, the