Article Per Year (5 Year)
p-Index From 2020 - 2025
1.607
P-Index
This Author published in this journals
All Journal Saintia Matematika InfoTekJar : Jurnal Nasional Informatika dan Teknologi Jaringan Abdimas Talenta : Jurnal Pengabdian Kepada Masyarakat Data Science: Journal of Computing and Applied Informatics Jurnal Varian FARABI: Jurnal Matematika dan Pendidikan Matematika Journal of Fundamental Mathematics and Applications (JFMA)
Sawaluddin Nasution
Program Studi Matematika, Universitas Sumatera Utara
Agriculture, Biological Sciences & Forestry Computer Science & IT Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Law, Crime, Criminology & Criminal Justice Mathematics Social Sciences Other

Published : 11 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 11 Documents
Search

 1   2 
Signcryption with Matrix Modification of RSA Digital Signature Scheme and Cayley-Purser Algorithm Ginting, Cindy Laurent; Budiman, Mohammad Andri; Nasution, Sawaluddin
Data Science: Journal of Computing and Applied Informatics Vol. 8 No. 1 (2024): Data Science: Journal of Computing and Applied Informatics (JoCAI)
Publisher : Talenta Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32734/jocai.v8.i1-12226

Abstract

The sender must ensure the security of messages and authenticated messages in messaging communications. Additionally, the sender must guarantee the message's integrity and cannot deny its authenticity or involvement with the message. This aspect is more robust because the recipient can verify, ensuring that the message originates from an authorized sender. In addition to this crucial aspect, the Signcryption method employing the Matrix Modification of RSA Digital Signature Scheme 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 performs one-way hashing during the signing procedure to enhance message security. This study tested the message plaintext in the form of a collection of strings consisting of uppercase (capital), lowercase (small), numbers (numeric), and other punctuation characters with varying numbers of characters in each string, as well as the value of modulus n from 10 digits up to its maximum length, which is unconstrained. The test results indicate that the time required for encryption and decryption is proportional to the number of plaintext characters used.
Co-Authors Ade Candra, Ade Agung Prabowo Bakti Siregar Defri Muhammad Chan Elvina Herawati Erna Budhiarti Nababan Erwin Fajrul Hasnan Sani Ginting, Cindy Laurent Herman Mawengkang Jonathan Liviera Marpaung M.R. Syahputra M.R. Syahputra Mahyuddin Mohammad Andri Budiman Muhammad Rafi Purba Opim Salim Sitompul Poltak Sihombing Rahmad Nurhadi Yusra Rudy Chandra Sitorus, Peniel Sam Putra Sutarman Sutarman T.J. Marpaung Tulus Tulus Tulus Tulus Tulus Tulus