Article Per Year (5 Year)
p-Index From 2020 - 2025
0
P-Index
This Author published in this journals
All Journal Journal of Mathematics UNP
Hendra Syarifuddin
Lecturers of Mathematics DepartmentUniversitas Negeri Padang, Indonesia
Computer Science & IT Decision Sciences, Operations Research & Management Mathematics

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

Found 1 Documents
Search

 1 
Modifikasi Algoritma Kriptografi RSA Multiprima Menggunakan Chinese Remainder Theorem dan Garner’s Algorithm Fatimah Putri Johari; Dewi Murni; Hendra Syarifuddin
Journal of Mathematics UNP Vol 4, No 2 (2019): Journal Of Mathematics UNP
Publisher : UNIVERSITAS NEGERI PADANG

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (308.603 KB) | DOI: 10.24036/unpjomath.v4i2.6311

Abstract

Abstract–Cryptographic algorithms multiprime RSA (Rivest-Shamir-Adleman)  is one of the public key cryptographic algorithms that are widely used, because the algorithm is easily applied and security is also guaranteed. But on the other hand this algorithm has drawbacks, namely the process of decryption a takes a relatively long time because using modular exponentiation. To address this, it will do modifications to the process of decrypting RSA Cryptographic algorithms multiprime by finding a method that can cut the number of modular exponentiation operation is great modular exponentiation operation into several smaller ones. This modification is only focused on the process of decryption is done by leveraging the next reminder: chinese theorem can be solved using Garner's algorithm. This modification of the results obtained a new private key used for decryption process Keywords –Cryptography, Multiprime RSA, Chinese Remainder Theorem(CRT), Garner’s Algorithm
Co-Authors Dewi Murni Fatimah Putri Johari