Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal JOURNAL OF INFORMATION SYSTEM RESEARCH (JOSH)
Hendrik Hendrik
Universitas Budi Darma, Medan
Computer Science & IT Decision Sciences, Operations Research & Management

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

Found 1 Documents
Search

 1 
Kombinasi Algoritma Huffman dan Algoritma ROT 13 Dalam Pengamanan File Docx Hendrik Hendrik
Journal of Information System Research (JOSH) Vol 2 No 1 (2020): Oktober 2020
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

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

Abstract

Behind this is often the theft of very important files, where they look for the files they need that they want. With no security for a title or file name, they will be very easy to find the file title they want. With the security of a file that is very important where a lot of people who are not responsible for controlling or owning the file. So this will cause a loss for the file owner if the file is known by others. The huffman algorithm is an algorithm that can be used to compress files, so that the resulting file size becomes smaller than the actual size. Huffman algorithm is a lossless compression algorithm. lossless compression algorithm is a compression technique that does not change an information from the original file. ROT13 (rotate 13) is a encryption substitution cipher that is commonly used in UNIX operating systems. In the ROT13 encryption system a letter is replaced by a letter that is located in the top 13 positions of it. With the existence of an application that implements a combination of the huffman algorithm and the ROT 13 algorithm used in the security of a docx file, making it difficult for file thieves to find the desired file
Co-Authors