Claim Missing Document
Check
Articles

Found 3 Documents
Search
Journal : KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer)

TEKNIK PENYEMBUNYIAN PESAN TEKS TERENKRIPSI ALGORITMA MERKLE-HELLMAN KNAPSACK MENGGUNAKAN METODE PIXEL VALUE DIFFERENCING KE DALAM CITRA DIGITAL Agung Lestari; Abdul Sani Sembiring; Taronisokhi Zebua
KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer) Vol 3, No 1 (2019): Smart Device, Mobile Computing, and Big Data Analysis
Publisher : STMIK Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/komik.v3i1.1590

Abstract

Optimization of data security techniques is very necessary so that the data or information that is secured is really safe from attack. Data that has been encrypted based on cryptographic techniques very quickly raises suspicion that the data is confidential or important. Therefore, this technique is better combined with steganography techniques. Utilization of steganography techniques can minimize the attacker's suspicion of data that is secured, because by using steganography data techniques can be hidden on certain objects. This study discusses how to encode a text based on the Merkle-Hellman Knapsack algorithm and the resulting password is hidden in a grayscale digital image as a hiding object based on the pixel value differencing algorithm. This is done to minimize suspicion and make it difficult for attackers to find out confidential or important data.Keywords: cryptography,steganography, merkle-hellmankanpsack, PVD, image
PENINGKATAN KEAMANAN DATA TEKS TERENKRIPSI ALGORITMA LUCIFER MENGGUNAKAN STEGANOGRAFI GIFSHUFFLE PADA CITRA Dian Anggara; Abdul Sani Sembiring
KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer) Vol 3, No 1 (2019): Smart Device, Mobile Computing, and Big Data Analysis
Publisher : STMIK Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/komik.v3i1.1626

Abstract

Increased resistance to the algorithm used to secure secret messages is very necessary. This is caused by the ability of the attackers who are able to justify various ways to solve the algorithm used to secure data. Lucifer algorithm has many variants, one of which is a lucifer with a 16-round feistel network that operates on 128 bit blocks and uses 128-bit keys. Computing 2 ^ 36 plaintext and 2 ^ 36 complexity can attack this variant. This study describes the use of the gifshuffle algorithm to optimize the Lucifer algorithm in securing data. The gifshuffle algorithm is used to hide encrypted messages based on the Lucifer algorithm into the gif format media. Based on tests conducted, it was found that there were no significant differences in the cover image and stegano image after the message insertion process was carried out.Keywords: Cryptography, Steganography, Lucifer, Gifshuffle, message
Analisa Perbandingan Algoritma Yamamoto’s Recursive Code Dan Algoritma Fibonacci Code Dalam Mengkompresi File Pptx Rahadi Putra; Abdul Sani Sembiring; Saidi Ramadan Siregar
KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer) Vol 6, No 1 (2022): Challenge and Opportunity For Z Generation in Metaverse Era
Publisher : STMIK Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/komik.v6i1.5697

Abstract

In the world of work, power point or pptx files are indispensable as presentation tools. By using pptx for presentations, presentation activities can be easier to explain. However, the problem that occurs is that sometimes the data size of this pptx file is quite large compared to other data, resulting in a waste of storage. So to solve the problem required compression technique, compression is to reduce the number of bits to be fewer, Thus, it is clear that the use of compression aims to reduce the percentage of storage. This research was conducted with the aim and purpose of analyzing the Yamamoto's recursive code algorithm and Fibonacci codes in pptx file compression with parameters, namely Ratio of Compression (RC), Compression Ratio (CR), and also Space Saving (SS). After being compressed then compare the performance of the two algorithms using the exponential method based on the parameter values that have been set. From the results of the study, the results obtained for the Yamamoto's recursive code algorithm with the RC value of 1.26, the CR value of 79.17%, and the SS value of 20.83%. For the results of the Fibonacci code algorithm, the RC value is 1.71, the CR value is 58.33%, the SS value and value is 41.66%. The results of the comparison of Yamammoto's recursive code algorithm and Fibonacci code obtained that the more optimal algorithm in compressing pptx files is the Fiboancci code algorithm with the acquisition of space saving values of 41.66%.