Article Per Year (5 Year)
p-Index From 2019 - 2024
0.23
P-Index
This Author published in this journals
All Journal Prosiding Snastikom
Aftaul Musla
Universitas Harapan Medan
Computer Science & IT Library & Information Science

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Kombinasi Kriptografi Algoritma Polyalphabetic Dan Kompresi Huffman Untuk Pengamanan Data Aftaul Musla; Tommy; Andi Marwan Elhanafi
SEMINAR NASIONAL TEKNOLOGI INFORMASI & KOMUNIKASI Vol. 1 No. 1 (2021): Prosiding Snastikom 2021
Publisher : Universitas Harapan Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (485.558 KB)

Abstract

he more advanced the world of technology produces new applications that can help make it easier for humans in the process of sending files and because of the ease with which these applications are accessed by humans, it does not rule out the possibility of fraud or file leaks from unauthorized parties. is also one of the factors to speed up the delivery process. Combining cryptography and compression techniques is one solution that can be done to overcome these problems. Cryptography is the expertise and science of ways for secure communication in the presence of unauthorized parties. Compression is a process to reduce the size of the data so that it can store more data and speed up the data transmission process. The algorithms used in this research are Polyalphabetic and Huffman. Implementation of this system is built in the form of a website. The results showed that securing and compressing files using Polyalphabetic and Huffman could restore the original file contents intact. Testing the Hufman algorithm shows that the compressed file size in several experimental samples with different sizes is directly proportional to the initial file size before being compressed.
Co-Authors Andi Marwan Elhanafi Tommy Tommy