Articles
<![CDATA[IMPLEMENTASI ALGORITMA ADVANCED ENCRYPTION STANDARD DAN TRIPLE DATA ENCRYPTION STANDARD UNTUK MENGAMANKAN CITRA DIGITAL ]]>
<![CDATA[Mahadi Winafil]]>;
<![CDATA[Sinar Sinurat]]>;
<![CDATA[Taronisokhi Zebua]]>
<![CDATA[ KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer) Vol 2, No 1 (2018): Peranan Teknologi dan Informasi Terhadap Peningkatan Sumber Daya Manusia di Era ]]>
Publisher : <![CDATA[STMIK Budi Darma ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.30865/komik.v2i1.975
<![CDATA[Digital images that are personal and confidential are very vulnerable to wiretapping by irresponsible parties. Especially if distributed via the internet network such as on Facebook, WhatsApp and e-mail chat based applications. Images that are sent sometimes are often confidential images and must be maintained. In order to maintain the security of digital images can be done by utilizing cryptographic techniques. Cryptographic techniques can secure digital images by changing pixel values from digital images so as to produce different pixel values from the original image to be secured. This research will use AES 128 bit and Triple DES methods for encryption and decryption of digital images on client-server based applications. The results of the encryption AES algorithm will be re-encrypted with the Triple DES Algorithm so as to produce pixel values that are far different from the original pixel values. Keywords: cryptography, image, AES, Triple DES]]>
<![CDATA[PERANCANGAN DAN IMPLEMENTASI ALGORITMA ELIAS GAMMA CODE UNTUK MENGKOMPRESI RECORD DATABASE PADA APLIKASI RANGKUMAN PENGETAHUAN UMUM LENGKAP ]]>
<![CDATA[Hikka Sartika]]>;
<![CDATA[Taronisokhi Zebua]]>
<![CDATA[ KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer) Vol 3, No 1 (2019): Smart Device, Mobile Computing, and Big Data Analysis ]]>
Publisher : <![CDATA[STMIK Budi Darma ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.30865/komik.v3i1.1600
<![CDATA[Storage space required by an application is one of the problems on smartphones. This problem can result in a waste of storage space because not all smartphones have a very large storage capacity. One application that has a large file size is the RPUL application and this application is widely accessed by students and the general public. Large file size is what often causes this application can not run effectively on smartphones. One solution that can be used to solve this problem is to compress the application file, so that the size of the storage space needed in the smartphone is much smaller. This study describes how the application of the elias gamma code algorithm as one of the compression technique algorithms to compress the RPUL application database file. This is done so that the RPUL application can run effectively on a smartphone after it is installed. Based on trials conducted on 64 bit of text as samples in this research it was found that compression based on the elias gamma code algorithm is able to compress text from a database file with a ratio of compression is 2 bits, compression ratio is 50% with a redundancy is 50%. Keywords: Compression, RPUL, Smartphone, Elias Gamma Code]]>
<![CDATA[SISTEM PENDUKUNG KEPUTUSAN PEMILIHAN INTERNET SERVICE PROVIDER MENERAPKAN METODE ELIMINATION AND CHOICE TRANSLATION REALITY (ELECTRE) ]]>
<![CDATA[Ismay Dahanum]]>;
<![CDATA[Mesran Mesran]]>;
<![CDATA[Taronisokhi Zebua]]>
<![CDATA[ KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer) Vol 1, No 1 (2017): Intelligence of Cognitive Think and Ability in Virtual Reality ]]>
Publisher : <![CDATA[STMIK Budi Darma ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.30865/komik.v1i1.506
<![CDATA[Internet users find it difficult to compare and know the quality of services provided by Internet Service Providers (ISP), most Internet users choose an Internet Service Provider (ISP) based on the experience and advice of other users. This is not necessarily appropriate to the needs, because a valid decision must be considered and taken into account from the criteria available to obtain a decision. Decision support systems are designed to help decision making and are interpreted as a datadriven model system that has procedures in data processing and data processing results used to make a decision. Therefore, with the construction of decision support systems can help Internet users in making more efficient decisions. The method used in decision support systems is Elimintaion And Choice Translation Realty (ELECTRE). with the establishment of an Internet Service Provider (ISP) decision support system by applying the ELECTRE method that is expected to assist internet users in determining the Internet Service Provider (ISP) that suits their needs.]]>
<![CDATA[IMPLEMENTASI METODE EVEN-RODEH CODE UNTUK KOMPRESI KITAB UNDANG-UNDANG HUKUM PIDANA (KUHP) BERBASIS ANDROID ]]>
<![CDATA[Nopiyah Belia Batubara]]>;
<![CDATA[Taronisokhi Zebua]]>
<![CDATA[ KOMIK (Konferensi Nasional Teknologi Informasi dan Komputer) Vol 3, No 1 (2019): Smart Device, Mobile Computing, and Big Data Analysis ]]>
Publisher : <![CDATA[STMIK Budi Darma ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.30865/komik.v3i1.1578
<![CDATA[Smartphones in addition to being a smartphone communication tool also functions as a tool for finding information. One application that is currently widely used by students and the public is KUHP application that run in mobile. KUHP application is an application that contains material of criminal laws. The KUHP application has large material and is stored in the application database after it is installed. The large size of the database of the Criminal Code application causes the need for large memory space at mobile. This has become one of the causes of smartphone memory performance to be reduced and slow. Compression technique can be used as a solution to the problem above. Compression aims to compress large data sizes into smaller ones, so that the required storage space decreases. This study describes how to do the compression process of the KUHP application material based on the Even Rodeh Code algorithm. Based on the results of tests conducted to compress 280 bits of data, it was found that the size of the data after being compressed was 176 bits, with compression ratio is 62.8%, ratio of compression is 1.59 bits, and redundancy is 37.2%.Keywords: Compression, KUHP Aplication, Even Rodeh Code, Database]]>
<![CDATA[Implementasi Algoritma Mars Pada Penyandian Record Database ]]>
<![CDATA[Alimah Alimah]]>;
<![CDATA[Nelly Astuti Hasibuan]]>;
<![CDATA[Taronisokhi Zebua]]>
<![CDATA[ Bulletin of Information Technology (BIT) Vol 1 No 1: Maret 2020 ]]>
Publisher : <![CDATA[Forum Kerjasama Pendidikan Tinggi (FKPT) ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (802.855 KB)
<![CDATA[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 Mars algorithm is an algorithm that uses a 128-bit key and the encryption process consists of 32 rounds. 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 image. This research uses the Mars 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 research describes the process of securing a database record by encoding it based on the Mars algorithm, 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]]>
<![CDATA[How to Create and Randomize a Vegenere Cipher Key Based on the Key Procedure of RC4+ Algorithm ]]>
<![CDATA[Taronisokhi Zebua]]>;
<![CDATA[Eferoni Ndruru]]>
<![CDATA[ The IJICS (International Journal of Informatics and Computer Science) Vol 3, No 2 (2019): September 2019 ]]>
Publisher : <![CDATA[STMIK Budi Darma ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (368.932 KB)
|
DOI: 10.30865/ijics.v3i2.1404
<![CDATA[The security of data not only depends on the complexity of the algorithm used, but one of the more important things to safeguard is key. The vegenere cipher algorithm is one of the common and easy to implement algorithms, but this algorithm is very easy to break with kasiki techniques by analyzing the word of cipher and keyword that have repetitive patterns. The RC4+ algorithm has the advantage of generating and generating fairly random keys. This research describes how to use the RC4+ key generation procedure to create and randomized the keys used in the vegenere cipher algorithm, to decrease recurrence of the same character of the cipher and character of the key]]>
<![CDATA[Implementation of Triple Transposition Vegenere Cipher Algorithm and Cipher Block Chaining for Encoding Text ]]>
<![CDATA[Fitarius Humendru]]>;
<![CDATA[Taronisokhi Zebua]]>
<![CDATA[ The IJICS (International Journal of Informatics and Computer Science) Vol 2, No 1 (2018): March 2018 ]]>
Publisher : <![CDATA[STMIK Budi Darma ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (274.421 KB)
|
DOI: 10.30865/ijics.v2i1.997
<![CDATA[Security of confidential text data and personal is very important so that the data is not misused by other parties. Many cryptographic algorithms can be used to secure data to keep the originality of confidential data. This study describes the use of triple transposition vegenere cipher algorithm which is combined with cipher block chaining mode for encoding text data with the aim to optimizing randomize of ciphers generated so that the security of confidential of data text is more optimal]]>
<![CDATA[SIMULASI ANTRIAN PELAYANAN PEMBAGIAN DANA PROGRAM SIMPANAN KELUARGA SEJAHTERA MENGGUNAKAN ALGORITMA FIRST COME FIRST SERVER (STUDI KASUS : PT. POS INDONESIA (PERSERO) MEDAN) ]]>
<![CDATA[Taronisokhi Zebua]]>;
<![CDATA[Syukur Novertiani Gulo]]>;
<![CDATA[Surya Darma Nasution]]>;
<![CDATA[Guidio Leonarde Ginting]]>
<![CDATA[ JURIKOM (Jurnal Riset Komputer) Vol 3, No 4 (2016): Agustus 2016 ]]>
Publisher : <![CDATA[STMIK Budi Darma ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (379.651 KB)
|
DOI: 10.30865/jurikom.v3i4.337
<![CDATA[Masalah antrian sangat sering dijumpai pada kehidupan sehari-hari. Seperti yang dihadapi oleh Kantor Pos dengan peran ganda. Selain penyedia layanan jasa antar barang, kantor pos juga berperan sebagai tempat penyalur dana program simpanan keluarga sejahtera. Analisis yang dilakukan meliputi pembentukan model antrian adalah model single queue multi server yang memiliki satu pintu input dan satu pintu output, simulasi antrian single queue multi server yaitu satu antrian ataupun tunggal dan mempunyai fasilitas, mempunyai banyak pelayanan dan lebih dari satu. Simulasi merupakan salah satu strategi pembelajaran yang bertujuan memberikan pengalaman belajar yang lebih kongkrit melalui tiruan-tiruan yang mendekati bentuk sebenarnya. Simulasi antrian pada algoritma first come first server menggambarkan bahwa orang yang lebih dahulu datang akan dilayani terlebih dahulu. Kalau ada proses tiba pada waktu yang sama, maka pelayanan mereka dilaksanakan melalui urutan mereka dalam antrian. Proses di antrian belakang harus menunggu sampai semua proses di depannya selesai. Antrian FCFS merupakan permasalahan yang ada terutama menyangkut kedatangan pelanggan (konsumen), permintaan pelayanan, kemudian terjadi antrian atau baris tunggu untuk memperoleh pelayanan tersebut, sehingga ada waktu tunggu. Seiring dengan kemajuan yang dicapai dengan menggunakan teknologi komputer, tahun demi tahun berkembang terus dengan pesatnya, untuk menyelesaikan masalah antrian ini dapat dipergunakan model antrian FCFS]]>
<![CDATA[Perancangan Aplikasi Pengacakan Pemenang Undian Berhadiah Menggunakan Metode Blum-Blum Shub Berbasis Android ]]>
<![CDATA[Citono Harahap]]>;
<![CDATA[Garuda Ginting]]>;
<![CDATA[Taronisokhi Zebua]]>
<![CDATA[ JURIKOM (Jurnal Riset Komputer) Vol 7, No 2 (2020): April 2020 ]]>
Publisher : <![CDATA[STMIK Budi Darma ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (298.018 KB)
|
DOI: 10.30865/jurikom.v7i2.2112
<![CDATA[Lottery or commonly known as a lottery is one way to raise funds used for humanitarian projects and social activities or a way to determine the winner randomly. So, the lottery does a random gift-giving process and the lottery is synonymous with the lottery. The design of a lottery winner randomization application is one of the more modern ways and can attract many lottery participants to enter the lottery by reducing the cost of printing and distributing lottery tickets. One of them is the blum blub shub method, which is a method that functions to generate random numbers mathematically with the resulting output is a series of binary numbers. the numbers that are made as winners. The designed application only simulates the process of inputting lottery numbers and the randomization process to get the winning numbers]]>
<![CDATA[Pembangkitan Kunci Beaufort Cipher Dengan Teknik Blum-blum Shub pada Pengamanan Citra Digital ]]>
<![CDATA[Eferoni Ndruru]]>;
<![CDATA[Taronisokhi Zebua]]>
<![CDATA[ Bulletin of Information Technology (BIT) Vol 3 No 2: Juni 2022 ]]>
Publisher : <![CDATA[Forum Kerjasama Pendidikan Tinggi (FKPT) ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.47065/bit.v3i2.302
<![CDATA[Data security is not only due to the complexity of the algorithms used, but one of the most important factors is the security of the keys used. One of the most popular data that needs to be backed up today is digital images. However, these days, the algorithms used to back up data are often attacked. This is because the structure of the key formations used is still weak. One of the data security algorithms that form a simple key is the Beaufort cipher. It relies on the duplication of key characters to form the key for each protected element. Key generators based on blum-blum shub technology can generate very random and difficult-to-guess keys, so the strength of the keys you use can enhance the resilience of protected data. Keys generated based on blum-blum shub technology will later be used in the process of encrypting and decrypting pixel values in digital images.]]>
