New Digital Signature Scheme Based on RSA Using Circulant Matrix

Abstract

One of the most important outcomes of public key cryptography is digital signature methods. These digital signature techniques allow digital communication with authenticity, integrity, and non-repudiation. Some extensions or modifications of the concept of digital signatures have been established in recent years by combining the notion of digital signatures with some specific protocol to accomplish the additional characteristics that a basic signature scheme does not provide. In the conventional classic public key situation, many specific realizations of these new sorts of signature schemes have been developed. A signer signs the message, and the receiver verifies the signature in a standard digital signature system. The typical digital currency is verifiable by the public. Signature techniques are ineffective if the receiver’s privacy is vital, and advanced technology necessitates the use of on Rivest, Adi Shamir, and Leonard Adleman (RSA) algorithm as the minimum key size to reduce message size. To achieve digital signatures in the form key size to reduce message size for representation of message in the form of a matrix in place of integers can reduce the key sizes along with the storage space without compromising the security. In this paper, we propose New Digital signature scheme based on RSA using circulant matrices. Security of our proposed scheme is based on RSA assumptions. We analyze the security of the proposed scheme.