Nurul Khairina
Politeknik Ganesha Medan

Published : 3 Documents
Claim Missing Document
Articles

## Title

### Found 3 Documents Search

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

#### 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.
ANALISIS STEGANOGRAFI METODE TWO SIDED SIDE MATCH Nurul Khairina
CESS (Journal of Computer Engineering, System and Science) Vol 1, No 2 (2016): Juli 2016
Publisher : Universitas Negeri Medan

#### Abstract

Abstrak—Terbatasnya ukuran citra terhadap panjang pesan yang akan disisipkan, menjadi salah satu pertimbangan dalam pemilihan metode steganografi dan jenis citra yang akan digunakan. Metode Two Sided Side Match adalah salah satu metode steganografi yang menggunakan dua sisi nilai pixel tetangganya yaitu sisi atas dan sisi kanan atas untuk menentukan berapa banyak biner pesan yang dapat disisipkan ke dalam sebuah pixel. Penelitian ini menganalisis cara kerja metode Two Sided Side Match  dalam mengamankan pesan rahasia dengan mengukur tingkat kerusakan citra hasil penyisipan pesan terhadap citra asli yang dihitung dengan nilai MSE (Mean Square Error). Jenis citra yang digunakan pada penelitian ini adalah jenis citra multilayer TIFF yang bertujuan untuk membantu kedua metode tersebut dalam menampung lebih banyak pesan. Penelitian ini menganalisis cara kerja penyisipan pesan dan ekstraksi pesan metode Two Sided Side Match serta mengukur tingkat kerusakan citra hasil penyisipan pesan terhadap citra asli yang dihitung dengan nilai MSE (Mean Square Error).Keywords— Steganografi, Two Sided Side Match.
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

#### 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.