Achieving security is the most important goal for any digital signature scheme. The security of RSA, the most widely used signature is based on the difficulty of factoring of large integers. The minimum key size required for RSA according to current technology is 1024 bits which can be increased with the advancement in technology. Representation of message in the form of matrix can reduce the key size and use of Tribonacci matrices can double the security of RSA. Recently M.Basu et.al introduced a new coding theorycalled Tribonacci coding theory based onTribonacci numbers, that are the generalization ofthe Fibonacci numbers. In this paper we present anew and efficient digital signature scheme usingTribonacci matrices and factoring.

RSA is the most widely used public key scheme for secure communication. Aboud et.al [1], proposed an improved version of original RSA scheme. They generalized it so that it can be implemented in the general linear group on the ring of integers mod n. In the proposed scheme the original message and the encrypted message are h × h square matrices with entries in Z n as against the original RSA scheme which involves integer values. However, we identified a shortcoming of that scheme and proposed a new and efficient RSA public key encryption scheme. We also propose a digital signature scheme based on the new scheme.

No abstract

No abstract