Dicky Apdilah, Dicky
Unknown Affiliation

Published : 2 Documents

Found 2 Documents

Generating Mersenne Prime Number Using Rabin Miller Primality Probability Test to Get Big Prime Number in RSA Cryptography Apdilah, Dicky; Khairina, Nurul; Harahap, Muhammad Khoiruddin
IJISTECH (International Journal Of Information System & 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 | Full PDF (234.912 KB) | DOI: 10.30645/ijistech.v1i1.1


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.
Penerapan Kriptografi RSA Dalam Mengamankan File Teks Berbasis PHP Apdilah, Dicky; Swanda, Heru
Publisher : Universitas Asahan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36294/jurti.v2i1.407


Abstract - Along with the development of communication technology human needs in the use of technology are increasing, especially in data storage. One way to improve security for data is by using cryptographic methods. RSA Algorithm (Rivest Shamir Adleman) is one method in the branch of cryptography, where RSA is a type of asymmetric cryptography that uses 2 keys, namely public and private keys. The problem of increasing the security of the public key and private key in RSA (Rivest Shamir Adlema) is that the Linear Congruential Generator (LCG) method is needed, LCG is used to generate a set of random numbers to n, where a set of random numbers will be taken that have a number value prime. One method for generating prime numbers is The Sieve Of Eratosthenes algorithm, The Sieve Of Eratosthenes algorithm is a classic algorithm for determining all prime numbers until the n-number is specified. The way the The Sieve Of Eratosthenes method works is to eliminate numbers that are not prime numbers, resulting in a collection of prime numbers. The prime number generated by the The Sieve Of Eratosthenes algorithm will be used for the public key and private key in the RSA criterion. Keywords - RSA, LCG, The Sieve of Eratosthenes.