dc.contributor.advisor | Budiman, Muhammad Andri | |
dc.contributor.advisor | Tulus, Tulus | |
dc.contributor.author | Dalimunte, Rosita | |
dc.date.accessioned | 2022-12-28T08:41:41Z | |
dc.date.available | 2022-12-28T08:41:41Z | |
dc.date.issued | 2012 | |
dc.identifier.uri | https://repositori.usu.ac.id/handle/123456789/78749 | |
dc.description.abstract | Security issues are an important aspect in the delivery of data and information. Common communication medium that can be used by anyone making it very vulnerable to interception of information by parties who are not entitled to know such information. One method used is to encrypt the contents of the information into a code. For that requires knowledge of cryptography, which learn the techniques to encode a message with specific algorithms. Elgamal algorithm is one of asymmetric algorithms in cryptography. This algorithm has a security level in solving the discrete logarithm problem on the group multiplication of integers modulo prime. In addition to the security level on solving the discrete logarithm, Elgamal algorithm has advantages in producing different ciphertext to plaintext the same in the encryption process. Each process in this algorithm using the theory of numbers, especially primes and modulo number. There are several ways to search for prime numbers, one way is to use the Sieve of Eratosthenes the algorithm. | en_US |
dc.language.iso | id | en_US |
dc.publisher | Universitas Sumatera Utara | en_US |
dc.subject | Cryptography | en_US |
dc.subject | ElGamal Algorithm | en_US |
dc.subject | the Algorithm of The Sieve of Eratosthenes | en_US |
dc.title | Pengamanan Pesan Teks dengan Algoritma Elgamal dan Algoritma Pembangkit Bilangan Prima The Sieve of Eratosthenes | en_US |
dc.type | Thesis | en_US |
dc.identifier.nim | NIM097038033 | |
dc.identifier.nidn | NIDN0008107507 | |
dc.identifier.nidn | NIDN0001096202 | |
dc.identifier.nidn | KODEPRODI55101#TeknikInformatika | |
dc.description.pages | 87 Halaman | en_US |
dc.description.type | Tesis Magister | en_US |