Articles
9
Documents
Analisis dan Implementasi Kompresi File Audio Dengan Menggunakan Algoritma Run Length Encoding (RLE)

Alkhawarizmi Vol 1, No 1 (2012): Jurnal Alkhawarizimi
Publisher : Alkhawarizmi

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

Abstract

Pengiriman file audio seringkali terhambat karena besarnya ukuran file yang akan dikirim. Salah satu cara untuk mengatasi hal tersebut adalah dengan memampatkan (kompresi) file tersebut sebelum dikirim. Penulis menggunakan algoritma Run Length Encoding yang bersifat lossless dalam pemampatan file audio. Masukan dalam sistem ini adalah file audio WAV dan MP3. Pada sistem ini terdapat tahap kompresi dan dekompresi. Tahap kompresi bertujuan untuk memampatkan ukuran file audio, sedangkan tahap dekompresi bertujuan untuk mengembalikan ukuran file audio ke ukuran semula.

Impelementasi Kompresi Teks Menggunakan Metode Huffman untuk Menghemat Karakter pada Short Message Service

Alkhawarizmi Vol 1, No 1 (2012): Jurnal Alkhawarizimi
Publisher : Alkhawarizmi

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

Abstract

Kajian ini membahas mengenai implementasi metode Huffman statis dalam penggunaan SMS yang masih memiliki kelemahan yaitu keterbatasan penulisan teks SMS untuk karakter 7-bit yang hanya sebanyak 160 karakter untuk satu kali kirim. Oleh sebab itu diperlukan proses kompresi dan dekompresi pada teks SMS dengan membuat aplikasi HuffmanKompresi, sehingga mampu menjadikan ukuran SMS tersebut seminimal mungkin pada saat dikirimkan. Setiap karakter yang dituliskan akan diubah menjadi bentuk bit sesuai dengan tabel statis Huffman, rangkaian bit tersebut akan dikirimkan ke nomor tujuan dengan menggunakan mode pengiriman BinaryMessage. Aplikasi ini dibuat dengan menggunakan bahasa Java yaitu J2ME dan berjalan pada mobile phone berbasis Java MIDP 2.0 dan konfigurasi CLDC 1.1. Pengirim dan penerima bisa berkomunikasi apabila aplikasi sudah terinstal dan dijalankan di mobile phone keduanya. Aplikasi ini bertujuan untuk menghemat pemakaian SMS dengan meminimalisasikan ukuran data yang akan dikirimkan. Sehingga dapat menghasilkan rasio penghematan kompresi sekitar 31%.

Implementasi Kombinasi Caesar dan Affine Cipher untuk Keamanan Data Teks

JEPIN (Jurnal Edukasi dan Penelitian Informatika) Vol 1, No 2 (2015): Volume 1, No 2
Publisher : Program Studi Informatika

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

Abstract

Petukaran data yang terjadi secara offline maupunonline sangat rentan dengan ancaman pencurian data. KombinasiCaesar dan Affine Cipher diharapkan mampu untuk menanganiisu keamanan data. Caesar Cipher bekerja denganmemanfaatkan pergeseran atau dikenal dengan shift ciphersementara Affine Cipher bekerja dengan menggunakan kunci duabuah bilangan integer. Kombinasi dua buah algoritma ini mampumengamankan data dan mengembalikan kembali ke bentukaslinya (plainteks), sehingga tidak menyebabkan integritasdatanya hilang.Kata Kunci—plainteks, cipherteks, Caesar cipher, Affinecipher.

Pengembangan Computer-Based Test Sebagai Strategi Peningkatan Efisiensi Evaluasi Kegiatan Belajar Mengajar

Juripol Vol 1 No 1 (2018): Jurnal Institusi Politeknik Ganesha Medan (Juripol) Januari 2018
Publisher : Politeknik Ganesha Medan

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

Abstract

One of the areas that can be a reference for the success and progress of a nation is the field of education. In the world of education, the examination has become one of the ways to measure learning achievement levels of students in the school. The examination that usually uses at school such as daily/weekly/monthly test, Midterm (UTS) and the Semester final exam (UAS). By using examination both students and teachers can evaluate each other about their teaching and learning activities. The examination model which used during this time is conventional methods model by using paper-based test. Traditional methods still have many shortcomings so that it takes another method for creating an efficient, effective, safe, accurate and fast test system. Another model which was already applied in the activities of the school students test is a method of Computer-Based Test (CBT Method). This way is proven to increase efficiency and effectiveness in the test. Unfortunately, this new approach is only applied to the activities of the national exam and have not been evenly distributed throughout the school. To use it in all the examination process such as daily/weekly/monthly test, Midterm (UTS) and the Semester final exam (UAS), the writer selected two school partners to implement CBT Exam in high school/Equal. Both schools are SMK Negeri 2 Binjai and MA "Mawaridussalam Deli Serdang. The target to be achieved is the creation of an alternative test method which can be used by the partner school that is more efficient, more effective, safer, more accurate and faster than old exam methods. The outcome which is to be accomplished is the creation of a system of computer-based test methods as an alternative method in the test of daily/weekly/monthly, UTS, and UAS on school partners by using PHP and My SQL.

IbM PENGUSAHA KERUPUK KARAK DI DESA DUKUH UNTUK MENINGKATKAN KUALITAS MAKANAN SEHAT DAN PENERAPAN INOVASI TEKNOLOGI TEPAT GUNA

Jurnal Kewirausahaan dan Bisnis Vol 20, No 11 (2017): Jurnal Kewirausahaan dan Bisnis
Publisher : Universitas Sebelas Maret

Show Abstract | Original Source | Check in Google Scholar

Abstract

Home industry of krupuk Karak in the subdistrict Mojolaban Sukoharjo district is currently growing with the number of many industries. Most of these industries still use borax as the developer material of batter dough. STPP is an alternative substance of borax replacement. STPP education as a substitute for borax should be done to eliminate the use of borax in food. Home industry in Sukoharjo district is still using manual labor for the production process of cracker karak. Appropriate technology can be provided to save time and production costs. The process of soaking batter dough has been the most time-consuming and energy-consuming process. Mincer as a meat grinder can be used to crush the dough.

On Factoring The RSA Modulus Using Tabu Search

Data Science: Journal of Computing and Applied Informatics Vol 1 No 1 (2017): Data Science: Journal of Computing and Applied Informatics (JoCAI)
Publisher : Talenta Publisher

Show Abstract | Original Source | Check in Google Scholar

Abstract

It is intuitively clear that the security of RSA cryptosystem depends on the hardness of factoring a very large integer into its two prime factors. Numerous studies about integer factorization in the field of number theory have been carried out, and as a result, lots of exact factorization algorithms, such as Fermat’s factorization algorithm, quadratic sieve method, and Pollard’s rho algorithm have been found. The factorization problem is in the class of NP (non-deterministic polynomial time). Tabu search is a metaheuristic in the field of artificial intelligence which is often used to solve NP and NP-hard problems; the result of this method is expected to be close-to-optimal (suboptimal). This study aims to factorize the RSA modulus into its two prime factors using tabu search by conducting experiments in Python programming language and to compare its time performance with an exact factorization algorithm, i.e. Pollard’s algorithm. The primality test is done with Lehmann’s algorithm.

Using random search and brute force algorithm in factoring the RSA modulus

Data Science: Journal of Computing and Applied Informatics Vol 2 No 1 (2018): Data Science: Journal of Computing and Applied Informatics (JoCAI)
Publisher : Talenta Publisher

Show Abstract | Original Source | Check in Google Scholar

Abstract

Abstract. The security of the RSA cryptosystem is directly proportional to the size of its modulus, n. The modulus n is a multiplication of two very large prime numbers, notated as p and q. Since modulus n is public, a cryptanalyst can use factorization algorithms such as Euler’s and Pollard’s algorithms to derive the private keys, p and q. Brute force is an algorithm that searches a solution to a problem by generating all the possible candidate solutions and testing those candidates one by one in order to get the most relevant solution. Random search is a numerical optimization algorithm that starts its search by generating one candidate solution randomly and iteratively compares it with other random candidate solution in order to get the most suitable solution. This work aims to compare the performance of brute force algorithm and random search in factoring the RSA modulus into its two prime factors by experimental means in Python programming language. The primality test is done by Fermat algorithm and the sieve of Eratosthenes.

Penyelesaian Sengketa Laut Antara Indonesia dan Malaysia di Wilayah Selat Malaka Menurut Hukum Laut Internasional

Lentera Hukum Vol 5 No 3 (2018): December 2018
Publisher : Universitas Jember

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

Abstract

The dispute settlement between Indonesia and Malaysia in the Malacca Strait started with the unilateral claims of both countries. The prevailing unilateral claims resulted in the area of Exclusive Economic Zone in the Malacca Strait overlap. The United Nations Convention on the Law of the Sea (UNCLOS) 1982 is the existing International Law of the Sea and both countries, Indonesia and Malaysia, ratified to this Convention. The purpose of this article is to find out how to resolve the sea border disputes between Indonesia and Malaysia in the Malacca Strait under the International Law of the Sea. In the end, this article is also aimed to provide a narrative to the factors underlying the existing maritime border dispute. Keywords: Disputes Settlement, Malacca Strait, Overlapping

Teknik Pemecahan Kunci Algoritma Rivest Shamir Adleman (RSA) dengan Metode Kraitchik

SinkrOn Vol 2 No 2 (2017): SinkrOn Volume 2 Nomor 2 Oktober 2017
Publisher : Politeknik Ganesha Medan

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

Abstract

Abstrak—Penelitian ini bertujuan memecahkan kunci privat algoritma RSA dengan memfaktorkan kunci publik n menggunakan metode Kraitchik dan melihat efisiensi waktu pemfaktorannya. Kriptanalisis dengan pemfaktoran (factoring) menggunakan kunci publik n yaitu n = p . q yang tidak dirahasiakan untuk memecahkan kunci privat RSA. Jika kunci publik n berhasil difaktorkan menjadi p dan q maka ɸ(n) = (p – 1)(q – 1) dapat dihitung dan dengan menggunakan kunci publik e, kunci privat d pun akan dapat terpecahkan. Metode Kraitchik yang mengawali munculnya algoritma pemfaktoran yang paling modern menyatakan bahwa untuk menemukan faktor x dan y dari bilangan bulat n sedemikian rupa sehingga x2 ≡ y2 (mod n). Hasil penelitian memperlihatkan bahwa efisiensi waktu pemfaktoran kunci publik n metode Kraitchik sangat dipengaruhi oleh selisih faktor kunci (p – q) yaitu semakin besar selisih antara p dan q maka semakin lama waktu pemfaktorannya. Pemfaktoran panjang kunci publik n sebesar 19 digit atau 152 bit dengan selisih faktor kunci (p – q) = 22641980 membutuhkan waktu selama 93,6002 ms lebih cepat jika dibandingkan dengan panjang kunci sebesar 15 digit atau 120 bit dengan selisih faktor kunci (p – q) = 23396206 yang membutuhkan waktu selama 5850,0103 ms. Faktor lainnya yang mempengaruhi efisiensi waktu pemfaktoran metode Kraitchik adalah Gcd (p – 1, q – 1), panjang kunci dan faktor prima (p – 1), (q – 1).Kata kunci—RSA, Kriptanalisis, Pemfaktoran (Factoring), Metode Kraitchik.