Claim Missing Document
Check
Articles

Found 3 Documents
Search
Journal : Journal of Computer System and Informatics (JoSYC)

Implementasi Algoritma Camellia Pada Penyandian Record Database Neti Rusri Yanti; Taronisokhi Zebua
Journal of Computer System and Informatics (JoSYC) Vol 1 No 3 (2020): Journal of Computer System and Informatics (JoSYC) - May 2020
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Database records in the form of text are very widely used, so it is very vulnerable to data theft by unauthorized parties. In order to maintain the security of database records, it can be done by using cryptographic techniques. Cryptographic techniques can encode database records by encrypting them in the form of passwords that are not understood. The Camellia algorithm is one algorithm that can be relied upon to realize cryptographic techniques. This symmetry algorithm will produce a higher level of security against the database record because it can encode it into a password with a fairly complex process that will make it difficult for cryptanalysts to access the database. This research will use the 128 bit Camellia algorithm for the encryption and decryption process, so that in the process it is necessary to go through several long steps in order to produce the final cipher. This algorithm requires 18 rounds where every six rounds must enter Function F and Function FL-1 and also require as many as 26 subkeys, namely kw, k and kl. This study describes the process of securing a database record by encoding it based on the Camellia algorithm, so that it produces a text record database in the form of a password that is difficult for others to understand and understand. This is done in an effort to minimize acts of misuse of database records.
Penerapan Algoritma Ternary Comma Code Pada Aplikasi Kompresi File Gambar Nurma Ningsih; Surya Darma Nasution; Taronisokhi Zebua
Journal of Computer System and Informatics (JoSYC) Vol 1 No 3 (2020): Journal of Computer System and Informatics (JoSYC) - May 2020
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Since the discovery of a tool to capture an image (image) in the form of a camera making technological developments not only focus on the tools but also must focus on where the data is stored. The need for storage media is something that is needed in every communication tool. Data and information communication systems are not only in the form of text but can also be in the form of images, videos and audio. Image file size that is relatively larger compared to text files is one of the causes of the amount of memory used for storing image files. The size of the image file can also cause the length of time to send the image file. Image file compression process is one way that can be done to overcome the problem of image file size. Image compression is an attempt to minimize the file size or bytes of a graphic file without reducing the quality of existing images. A certain amount of storage, such as disk space or memory, makes it possible to reduce the image file size. Many algorithms that can be used to compress image file sizes include the ternary comma code algorithm that can help reduce image file sizes. The ternary comma code algorithm has a faster time space compared to other algorithms.
Kinerja Algoritma Yamamoto’s Recursive Code dan Algoritma Fixed Length Binary Encoding pada Kompresi File PDF Yulrismawati Sihura; Taronisokhi Zebua; Hukendik Hutabarat
Journal of Computer System and Informatics (JoSYC) Vol 3 No 4 (2022): August 2022
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/josyc.v3i4.2109

Abstract

The use of files in digital form is currently growing and requires media to store them. The more files that store, the more storage space need. This encourages the development of file reduction techniques or data compression techniques with the aim of reducing the required storage space. The compression technique has several algorithms that can be used to compress files such as Yamamoto's recursive code algorithm and Fixed Length Binary Encoding (FLBE). These algorithms have different performance to produce quality compressed results, so they need to be compared. This study describes the analysis and comparison of the performance of the two algorithms based on the exponential method as measured by the quality of the compressed pdf file. The exponential comparison method is one of the methods of the Decision Support System (DSS) to determine the priority order of decision alternatives with multiple criteria. Compression quality parameters that are measured as an alternative comparison are the value of the ratio of compression, compression ratio, space saving. Based on the results of the comparison with Exponential Comparison Method (MPE), it was found that the fixed length binary encoding algorithm has a better performance with a value of 2.55% compared to the Yamomoto's recursive code algorithm with a smaller value of 2.22%.