DEVELOPING RSA AND RABIN SIGNATURE SCHEMES IN CASE OF EXPONENT E=3

Abstract

The RSA and Rabin signature schemes are both developed based on the difficulty of the factorizing problem. While the exponent e in the RSA scheme has to satisfy gcd(e,(n)) = 1, in the Rabin scheme, e=2 and is always the divisor of (n). On solving the problem of constructing a signature scheme with low signature-verifying cost for digital transaction that require authentication of signature validity in a great deal, this study suggests a signature schemes base on the graphical model in case of exponent e= 3 and 3 is the divisor of (n). This scheme is similar to the Rabin scheme, with e=3 as the divisor
of (p-1) and (q-1). With exponent e=3, the schemes have low signature-verifying cost, which meet the requirement of the problem above.