A New Probabilistic Digital Signature Scheme Based on Integer Factorization Problem

摘要

The RSA algorithm is deterministic in nature, due to this it has some implementation flaws. Taking this into consideration Bellare and Rogway proposed probabilistic digital signature scheme for RSA with tight security assertions (efficiently deals with implementation flaws). But according to RSA laboratories the time complexity of the signature will keep increasing as long as the problem gets harder and modulus is approximately 2048 bit, and if SHA-256 is used, then only 256 bits are utilized and decreases bandwidth. In this paper, we propose another probabilistic digital signature scheme for RSA with tight security assertions, which is more efficient than probabilistic signature scheme (PSS) and if modulus is approximately 2048 bit, then whole 2048 bits can be utilized even after using SHA-256.