Analisis Kompleksitas Waktu Algoritma Kriptografi Elgamal dan Data Encryption Standard

  • Herman Kabetta STMIK Widya Utama

Abstract

ElGamal as an asymmetric key cryptography system and Data Encryption Standard (DES) as a symmetric key cryptography system, both of algorithms will be compared using the time complexity analysis and computer simulation. The result of time analysis shows a different complexity for both algorithms, there is quadratic complexity for ElGamal Algorithm and Linear Complexity for DES algorithm. Input that is used by ElGamal algorithm is the private key, while for DES algorithm is the plaintext’s size. Based on result of simulation using a computer program, it shows a significant timing differences, ElGamal’s time execution is longer than DES. This is caused by differences of arithmetic operations that is used by each algorithms.

References

[1] Mathur, A. 2012. A Research paper : An ASCII Value Based Data Encryption Algorithm and Its Comparison with Other Symmetric Data Encryption Algorithms. International Journal on Computer Science and Engineering (IJCSE), 4(9), 1650–1657.
[2] Kabetta, H., & Dwiandiyanta, B. 2012. Information Hiding in CSS: A Secure Scheme Text-Steganography using Public Key Cryptosystem. arXiv preprint arXiv:1201.1968. Retrieved from http://arxiv.org/abs/1201.1968
[3] Denning, D. E., & Sacco, G. M. 1981. Timestamps in Key Distribution Protocols. Communications of the ACM, 24(8), 533–536. doi:10.1145/358722.358740
[4] Jeeva, A. L., Palanisamy, D. V, & Kanagaram, K. 2012. Comparative Analysis of Performance Efficiency and Security Measures of Some Encryption Algorithms. International Journal of Engineering Research and Applications (IJERA) ISSN, 2(3), 2248–9622.
[5] Singh, P., & Singh, K. 2013. Image Encryption and Decryption Using Blowfish Algorithm In MATLAB. International Journal of Scientific & Engineering Research, 4(7), 150–154.
[6] Hanno, B. 2015. A Look At the PGP Ecosystem through the Key Server Data. IACR Cryptology ePrint Archive, 262.
[7] Bernhard, D., Fischlin, M., & Warinschi, B. 2016. On the Hardness of proving CCA-Security of Signed ElGamal. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9614, 47–69. doi:10.1007/978-3-662-49384-7_3
[8] Bahri, R. S., & Maliki, I. 2012. Feature Extraction Pada Optical Character Recognition. Jurnal Komputer dan Informatika (KOMPUTA), 1(I).
[9] Smart, N. P., Paterson, K., & Cramer, R. 2015. Cryptography Made Simple. doi:10.1007/978-3-319-21936-3
[10] Bajaj, S., & Khajuri, K. 2016. Enhancement of Security in Visual Cryptography using DES. International Journal of Engineering Science and Computing, 6(7).
Published
2017-10-11
How to Cite
KABETTA, Herman. Analisis Kompleksitas Waktu Algoritma Kriptografi Elgamal dan Data Encryption Standard. Teknikom: Teknologi Informasi, Ilmu Komputer dan Manajemen, [S.l.], v. 1, n. 1, p. 13-18, oct. 2017. ISSN 2598-2958. Available at: <http://journal.swu.ac.id/teknikom/article/view/2>. Date accessed: 22 july 2019.
Section
Articles