Signcryption menggunakan Tanda Tangan Digital RSA dengan Modifikasi Matriks dan Algoritma Cayley-Purser

Abstract

In messaging communication, the sender must guarantee the confidentiality and authenticity of messages. In addition, the sender must assure the message's integrity and cannot deny its authenticity or responsibility for the message. This aspect has a more robust quality because the recipient can verify, ensuring that the message originates from an authorized sender. In addition to this essential aspect, the Signcryption method employing the RSA Digital Signature Scheme Matrix Modification and the Cayley-Purser Algorithm can accomplish both of the objectives of this study. Encrypt-then-sign is the Signcryption method used, and the MD5 hash function is used to perform one-way hashing during the signing procedure to enhance message security. The message is examined in the form of files with varying bytes and with varying bytes, as well as the value of modulus n from 10 digits to the maximum length that is not restricted. The results of the tests indicate that signing the hash value of the encrypted message reduces the signcryption process time. In security testing using the exact factorization method against the public key with the Pollard Rho Algorithm, factoring the public key modulus n along 30 decimal digits requires 359.8 seconds.