p-Index From 2021 - 2026
6.431
P-Index
This Author published in this journals
All Journal InfoTekJar : Jurnal Nasional Informatika dan Teknologi Jaringan Sinkron : Jurnal dan Penelitian Teknik Informatika JurTI (JURNAL TEKNOLOGI INFORMASI) Zero : Jurnal Sains, Matematika, dan Terapan IJISTECH (International Journal Of Information System & Technology) Jurdimas (Jurnal Pengabdian Kepada Masyarakat) Royal JOURNAL OF SCIENCE AND SOCIAL RESEARCH JURSIMA (Jurnal Sistem Informasi dan Manajemen) REMIK : Riset dan E-Jurnal Manajemen Informatika Komputer INFOKUM Community Development Journal: Jurnal Pengabdian Masyarakat Journal of Computer Science, Information Technology and Telecommunication Engineering (JCoSITTE) LEGAL BRIEF Journal of Computer Networks, Architecture and High Performance Computing IJISTECH Yayasan Cita Cendikiawan Al Khwarizmi Proceeding International Seminar of Islamic Studies Jurnal Minfo Polgan (JMP) sudo Jurnal Teknik Informatika Hello World Factory Jurnal Industri, Manajemen dan Rekayasa Sistem Industri Jurnal Pemberdayaan Sosial dan Teknologi Masyarakat JURSIMA Journal of Innovation in Research, Education and Culture (JIREC) Jurnal Sistem Informasi dan Manajemen Jurnal Pengabdian Masyarakat dan Riset Pendidikan Jurnal Intelek Dan Cendikiawan Nusantara Jurnal Intelek Insan Cendikia Applied Information Technology and Computer Science (AICOMS) Portal Riset dan Inovasi Sistem Perangkat Lunak Al'Adzkiya International of Computer Science and Information Technology Journal Jurnal Pengabdian dan Inovasi Masyarakat
Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : IJISTECH

Generating Mersenne Prime Number Using Rabin Miller Primality Probability Test to Get Big Prime Number in RSA Cryptography Dicky Apdilah; Nurul Khairina; Muhammad Khoiruddin Harahap
IJISTECH (International Journal of Information System and Technology) Vol 1, No 1 (2017): November
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30645/ijistech.v1i1.1

Abstract

Cryptography RSA method (Rivest - Shamir - Adelman) require large-scale primes to obtain high security that is in greater than or equal to 512, in the process to getting the securities is done to generation or generate prime numbers greater than or equal to 512. Using the Sieve of Eratosthenes is needed to bring up a list of small prime numbers to use as a large prime numbers, the numbers from the result would be combined, so the prime numbers are more produced by the combination Eratosthenes. In this case the prime numbers that are in the range 1500 < prime <2000, for the next step the result of the generation it processed by using the Rabin - Miller Primarily Test. Cryptography RSA method (Rivest - Shamir - Adleman) with the large-scale prime numbers would got securities or data security is better because the difficulty to describe the RSA code gain if it has no RSA Key same with data sender.