Show simple item record

dc.contributor.advisorBudiman, Muhammad Andri
dc.contributor.advisorTulus, Tulus
dc.contributor.authorDalimunte, Rosita
dc.date.accessioned2022-12-28T08:41:41Z
dc.date.available2022-12-28T08:41:41Z
dc.date.issued2012
dc.identifier.urihttps://repositori.usu.ac.id/handle/123456789/78749
dc.description.abstractSecurity 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.isoiden_US
dc.publisherUniversitas Sumatera Utaraen_US
dc.subjectCryptographyen_US
dc.subjectElGamal Algorithmen_US
dc.subjectthe Algorithm of The Sieve of Eratosthenesen_US
dc.titlePengamanan Pesan Teks dengan Algoritma Elgamal dan Algoritma Pembangkit Bilangan Prima The Sieve of Eratosthenesen_US
dc.typeThesisen_US
dc.identifier.nimNIM097038033
dc.identifier.nidnNIDN0008107507
dc.identifier.nidnNIDN0001096202
dc.identifier.nidnKODEPRODI55101#TeknikInformatika
dc.description.pages87 Halamanen_US
dc.description.typeTesis Magisteren_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record