2017
DOI: 10.22146/jnteti.v6i3.326
|View full text |Cite
|
Sign up to set email alerts
|

Pemfaktoran Bilangan Prima pada Algoritme ElGamal untuk Keamanan Dokumen PDF

Abstract: Abstract-Utilization of document files does not guarantee the security of those documents. There are acts of plagiarism of txt and doc files. Converting files into PDF can help secure the files, because PDF can not be easily plagiarized and a password can be embedded into the files. But, nowadays, PDF files also can be modified by other parties, thus, reducing the security of the files. This paper utilizes factor of prime and random numbers in cryptography using ElGamal algorithm to encrypt PDF plaintext docum… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0
1

Year Published

2018
2018
2020
2020

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 2 publications
0
1
0
1
Order By: Relevance
“…This algorithm is generally used for digital signatures, but then modified so that it can be used for encryption and decryption. The security of the Elgamal algorithm lies in the difficulty of calculating discrete logarithms in large prime modules, so that efforts to solve these algorithm problems are difficult to solve [21]. This algorithm has the advantage of generating keys using discrete logarithms and decryption encryption methods that use large computational processes so that the encryption results are twice the original size [22].…”
Section: Elgamal Algorithmmentioning
confidence: 99%
“…This algorithm is generally used for digital signatures, but then modified so that it can be used for encryption and decryption. The security of the Elgamal algorithm lies in the difficulty of calculating discrete logarithms in large prime modules, so that efforts to solve these algorithm problems are difficult to solve [21]. This algorithm has the advantage of generating keys using discrete logarithms and decryption encryption methods that use large computational processes so that the encryption results are twice the original size [22].…”
Section: Elgamal Algorithmmentioning
confidence: 99%
“…Seperti yang telah didiskusikan pada penelitian-penelitian sebelumnya, persyaratan keamanan yang harus dipenuhi meliputi ketersediaan, kerahasiaan, integritas, autentikasi, serta tidak adanya penolakan dari node yang ada di jaringan ad-hoc [1], [2]. Kerahasiaan dari komunikasi antar node dijamin dengan skema enkripsi dan dekripsi pesan.…”
Section: Kata Kunci-secret Key Praproses Reciprocity Hierarchical unclassified