Article Per Year (5 Year)
p-Index From 2019 - 2024
0
P-Index
This Author published in this journals
All Journal CESS (Journal of Computer Engineering, System and Science) IJISTECH (International Journal Of Information System & Technology) IJISTECH
Nurul Khairina
Politeknik Ganesha Medan
Computer Science & IT Decision Sciences, Operations Research & Management Electrical & Electronics Engineering Engineering Social Sciences

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

Found 1 Documents
Search
Journal : IJISTECH

 1 
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.
Co-Authors Dicky Apdilah Muhammad Khoiruddin Harahap