scholarly journals Analisis Dan Implementasi Algoritma Kriptografi Playfair Chiper Dan Algoritma Kompresi Run Length Encoding Dalam Pengamanan Dan Kompresi Data Teks

2018 ◽  
Vol 1 (1) ◽  
pp. 069-077
Author(s):  
Ananda Dwi Putri ◽  
Dian Rachmawati ◽  
Heriyance Heriyance
Keyword(s):  
Data Transmission ◽  
Data Security ◽  
Execution Time ◽  
Compression Algorithm ◽  
Algorithmic Complexity ◽  
Information Compression ◽  
Compression Process ◽  
Run Length ◽  
Cryptographic Algorithm

Komunikasi dan bertukar informasi secara jarak jauh sudah sangat mudah dan praktis. Kemudahan ini menuntut peningkatan keamanan terhadap kerahasiaan data yang dikirim. Kriptografi adalah salah satu cara yang digunakan untuk menjaga kerahasian dari sebuah pesan, dimana pesan disamarkan menjadi sandi. Selain keamanan data yang perlu diperhatikan juga adalah kecepatan dalam pengiriman data tersebut. Kecepatan pengiriman ini tergantung dari ukuran informasi tersebut. Kompresi adalah proses pengubahan sekumpulan data menjadi bentuk kode dengan tujuan untuk menghemat kebutuhan tempat penyimpanan dan waktu untuk transmisi data. Dalam penelitian ini penulis mengkombinasi algoritma kriptografi Playfair Cipher dengan algoritma kompresi Run Length Encoding, serta menganalisa kedua algoritma menggunakan kompleksitas algoritma. waktu eksekusi pesan dengan 16 karakter adalah 0.54423 sekon, waktu eksekusi pesan dengan 78 karakter adalah 1.14617 sekon, dan waktu eksekusi pesan dengan 189 karakter adalah 1.51715 sekon. Hasil pengujian proses kompresi string Homogen dengan kompresi rasio rata-rata sebesar 33.83% dan sring Heterogen dengan kompresi rasio rata-rata sebesar 15,54%. Dapat disimpulkan jumlah karakter pada pesan berbanding lurus terhadap waktu. Communication and exchanging information remotely are very easy and practical. This convenience requires increased security against the confidentiality of the data sent. Cryptography is one way used to maintain the confidentiality of a message, where the message is disguised as a password. In addition to data security, the speed in sending the data also needs to be considered. This speed of delivery depends on the size of the information. Compression is the process of converting a set of data into a code form with the aim of saving storage needs and time for data transmission. In this study, the researcher combined the Playfair Cipher cryptographic algorithm with the Run Length Encoding compression algorithm and analyzed both algorithms using algorithmic complexity. Message execution time with 16 characters was 0.54423 seconds. Message execution time with 78 characters was 1.14617 seconds, and message execution time with 189 characters was 1.51715 seconds. The result test was an average of 33.83% for the Homogeneous string compression process with compression ratios, and 15.54% for the Heterogeneous string with compression ratios. It could be concluded that the number of characters in the message was directly proportional to time. 

scholarly journals IMPLEMENTASI ALGORITMA HUFFMAN DAN RUN LENGTH ENCODING PADA APLIKASI KOMPRESI BERBASIS WEB

2018 ◽  
Vol 4 (2) ◽  
Author(s):  
Eka Prayoga ◽  
Kristien Margi Suryaningrum
Keyword(s):  
Digital Media ◽  
Data Storage ◽  
Data Transmission ◽  
Data Security ◽  
File Size ◽  
Compression Process ◽  
Web Based ◽  
Run Length ◽  
Transmission Process ◽  
Shape And Size

[Id]Meningkatnya penggunaan media digital dalam kehidupan sehari-hari secara tidak langsung turut meningkatkan kebutuhan dalam penyimpanan data, oleh karena itu dibutuhkan sebuah metode untuk menangani hal tersebut, salah satunya adalah dengan menerapkan kompresi data. Kompresi adalah teknik dalam memampatkan suatu data untuk menghemat media penyimpanan yang digunakan, selain itu, kompresi pun dapat dimanfaatkan untuk kebutuhan lain, seperti backup data, proses pengiriman data, serta keamanan data. Pemampatan atau kompresi pada umumnya diterapkan pada mesin komputer, karena setiap simbol yang ditampilkan memiliki bit-bit yang berbeda. Penulis menggunakan algoritma Huffman dan Run Length Encoding dalam proses pemampatan yang dilakukan, dimana masukkannya adalah file TXT. Tujuan penelitian ini adalah untuk mengetahui bagaimana implementasi dari gabungan antara kedua algoritma tersebut, selain itu, penelitian ini juga bertujuan untuk mengetahui bagaimana rasio perbandingan ukuran file antara file awal dan file yang terkompresi. Implementasi sistem yang dilakukan memanfaatkan aplikasi berbasis web untuk memudahkan pengguna dalam memanfaatkan fitur sistem yang ada, dimana dalam sistem ini memuat proses kompresi dan dekompresi. Tahapan kompresi digunakan untuk proses pemampatan, dan tahapan dekompresi untuk proses pengembalian file ke bentuk dan ukuran yang semula. Penelitian dilakukan dengan menggunakan 5 data uji, dan menunjukkan ukuran file hasil dekompres tidak seperti semula karena proses kompresi yang bersifat lossy.Kata kunci :Kompresi, TXT, Dekompresi, Huffman, Run Length Encoding[En]Increasing the use of digital media in life indirectly also increases the need for data storage, therefore needed a method to handle it, one of them is by applying data compression. Compression is a technique which compress data to save used storage, in addition, any compression can be used for other needs, such as data backup, data transmission process, and data security. Compression or compression is generally applied to a computer machine, because every symbol displayed has different bits. Writer here used Huffman and Run Length Encoding algorithm in the compression process, where the input is TXT file. The purpose of this study is to find out how the implementation of the combination between the two algorithms, in addition, this study also aims to find out how the ratio of file sizes between the initial file and the compressed file. Implementation of the system made use of web-based applications to facilitate users in utilizing the features of existing systems, which in this system includes the compression and decompression process. The compression stages are used for the compression process, and the decompression stage for the process of returning the file to its original shape and size. The study was conducted using 5 test data, and showed the decompress file size is not as original because the compression process is categorized as lossy

scholarly journals An Optimal Multilevel Encryption Technique for Securing the Data Transmission in IoT

2020 ◽  
Vol 9 (3) ◽  
pp. 1239-1242
Keyword(s):  
Internet Of Things ◽  
Elliptic Curve ◽  
Data Transmission ◽  
Data Security ◽  
Elliptic Curve Cryptography ◽  
Daily Life ◽  
Secret Message ◽  
Critical Component ◽  
Iot Applications ◽  
Iot Devices

Internet of Things(IoT) is playing a pivotal role in our daily life as well as in various fields like Health, agriculture, industries etc. In the go, the data in the various IoT applications will be easily available to the physical dominion and thus the process of ensuringthe security of the data will be a major concern. For the extensive implementation of the numerous applications of IoT , the data security is a critical component. In our work, we have developed an encryption technique to secure the data of IoT. With the help of Merkle-Hellman encryption the data collected from the various IoT devices are first of all encrypted and then the secret message is generated with the help of Elliptic Curve Cryptography.

scholarly journals Cryptosystem for Secure Data Transmission using Advance Encryption Standard (AES) and Steganography

2019 ◽  
pp. 317-322 ◽  
Author(s):  
Musa. M. Yahaya ◽  
Aminat Ajibola
Keyword(s):  
Digital Media ◽  
Data Transmission ◽  
Data Security ◽  
Data Transfer ◽  
Business Owners ◽  
Advanced Encryption Standard ◽  
Least Significant Bit ◽  
Media Image ◽  
Key Players ◽  
Secure Data Transmission

Recently, the rate of data transfer over the internet globally has increased and this called for more data security as security of data is of great concern for individuals as well as business owners. Cryptography and steganography are two major key players for data security technique. Cryptography is use to perform encryption on the secrete message while steganography hides the secrete message in digital media, image in this regards. This paper employed these two techniques using Advanced Encryption Standard (AES) for the cryptography and Least Significant Bit (LSB) for the steganography. Combining the two algorithms ensured data integrity, data security, and flexibility. The changes in the secrete message carrier (Stego) is insignificant and is often not noticeable by the nicked eyes, thus this make the interception of the message often difficult by intruder.

scholarly journals A Compression Algorithm for DNA Palindrome Compression Technique

2020 ◽  
Vol 32 ◽  
pp. 03006
Author(s):  
D. Suneetha ◽  
D. Rathna Kishore ◽  
P. Narendra Babu
Keyword(s):  
Compression Algorithm ◽  
Experimental Result ◽  
Compression Process ◽  
Compression Technique ◽  
Plain Text ◽  
Security Issues ◽  
Cipher Text ◽  
Different Types ◽  
Dna Palindrome ◽  
Better Than

Data Compression in Cryptography is one of the interesting research topic. The compression process reduces the amount of transferring data as well as storage space which in turn effects the usage of bandwidth. Further, when a plain text is converted to cipher text, the length of the cipher text becomes large. This adds up to tremendous information storing. It is extremely important to address the storage capacity issue along with the security issues of exponentially developing information. This problem can be resolved by compressing the ciphertext based on a some compression algorithm. In this proposed work used the compression technique called palindrome compression technique. The compression ratio of the proposed method is better than the standard method for both colored and gray scaled images. An experimental result for the proposed methods is better than existing methods for different types of image.

scholarly journals Reliability Measurement in A Multi-path Transmission Network using SMP-BP Algorithm

2019 ◽  
Vol 15 (11) ◽  
pp. 16
Author(s):  
Xiaoling Li ◽  
Xinwei Zhou
Keyword(s):  
Data Transmission ◽  
Data Security ◽  
Network Reliability ◽  
Transmission Network ◽  
Network Resources ◽  
Minimal Path ◽  
Transmission Networks ◽  
Backup Path ◽  
Efficient Data ◽  
Reliability Measurement

Data security is very important in the multi-path transmission networks (MTN). Efficient data security measurement in MTN is crucial so as to ensure the reliability of data transmission. To this end, this paper presents an improved algorithm using single-single minimal path based back-up path (SSMP-BP), which is designed to ensure the data transmission when the second path is out of work. From the simulation study, the proposed algorithm has the better network reliability compared with existing double minimal path based backup path (DMP-BP) approach. It could be found that, the proposed algorithm uses less back-up paths compared with DMP-BP so that less network resources like nodes are achieved.

XML Digital Signature Application in Network Test System

2014 ◽  
Vol 513-517 ◽  
pp. 2016-2019
Author(s):  
Xiao Feng Wang
Keyword(s):  
Digital Signature ◽  
Data Transmission ◽  
Data Security ◽  
Digital Signatures ◽  
Test System ◽  
Signature Verification ◽  
Network Data ◽  
Verification Process ◽  
Network Test System ◽  
Xml Digital Signature

This paper describes the concept of XML digital signatures, analyzes the digital signature and the signature verification process, describes the W3C digital signature specification, and studies how to ensure data security in network exam in C #.NET environment. Experiments show that: XML digital signature in network test system ensures the integrity of network data transmission, the identity of verifiability and non-repudiation.

NON-BREAKABLE DATA ENCRYPTION WITH CLASSICAL INFORMATION

2004 ◽  
Vol 04 (02) ◽  
pp. C1-C5 ◽  
Author(s):  
LASZLO B. KISH ◽  
SWAMINATHAN SETHURAMAN
Keyword(s):  
Homeland Security ◽  
Data Transmission ◽  
Data Security ◽  
Data Encryption ◽  
Digital Information ◽  
Classical Information ◽  
Security Applications ◽  
Secure Data Transmission ◽  
Factorization Algorithms ◽  
Quantum Encryption

Secure encryption of data is one of the most important parts of information technology and major concern of data security, military, defense and homeland security applications. The main aim of the paper is to propose a new way of approach to encryption. We propose a new possible approach [1] to encryption, which could be a fast, simple, inexpensive, robust, flexible, and mobile way of data encryption for absolutely secure data transmission by using classical digital information. The Eavesdropper is allowed to know the received signal thus the method has a higher level of protection than that of quantum encryption. Factorization algorithms do not help to break the code. Proper scrambling operators, which are necessary for the method, are study of current research.

Research on Vessel Trajectory Multi-Dimensional Compression Algorithm Based on Douglas-Peucker Theory

2014 ◽  
Vol 694 ◽  
pp. 59-62 ◽  
Author(s):  
Fei Xiang Zhu ◽  
Li Ming Miao ◽  
Wen Liu
Keyword(s):  
Compression Algorithm ◽  
Spatial Distance ◽  
Automatic Identification ◽  
Identification System ◽  
Trajectory Data ◽  
Compression Process ◽  
Maritime Traffic ◽  
Offset Distance ◽  
Improved Algorithm

Currently, maritime safety administrations or shipping company had received a large number of vessel trajectory data from Automatic Identification System (AIS). In order to more efficiently carry out research of maritime traffic flow, ship behavior and maritime investigation, it is important to ensure the quality of the vessel trajectory data under compression condition. In classic Douglas-Peucker vector data compression algorithm, offset spatial distance of each point was the single factor in compression process. In order to overcome the shortcomings of classic Douglas-Peucker, a vessel trajectory multi-dimensional compression improved algorithm is proposed. In improved algorithm, the concept of single trajectory point importance which considers the point offset distance and other vessel handling factors, such as the vessel turning angle, speed variation, is proposed to as the compression index. Compared to classic Douglas-Peucker algorithm, experiment results show that the proposed multi-dimensional vessel trajectory compression improved algorithms can effectively retain characteristics of navigation.

Sign in / Sign up

Export Citation Format

Share Document