Claim Missing Document
Check
Articles

Found 10 Documents
Search

Implementasi Kombinasi Caesar dan Affine Cipher untuk Keamanan Data Teks Rachmawati, Dian; Candra, Ade
JEPIN (Jurnal Edukasi dan Penelitian Informatika) Vol 1, No 2 (2015): Volume 1, No 2
Publisher : Program Studi Informatika

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (289.232 KB) | DOI: 10.26418/jp.v1i2.12587

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.
PENDIDIKAN SEKSUAL SEJAK DINI PADA ANAK Rachmawati, Dian; Nurhidayah, S. Psi., M.Si, Siti
DEVOSI Vol 1 No 2 (2020): Devosi Jurnal Pengabdian Masyarakat
Publisher : LPPM Universitas Islam 45 Bekasi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33558/devosi.v1i2.2504

Abstract

Sexual education is a clear and correct information regarding the issue of human sexuality which includes knowledge of conception, pregnancy, and the birth of sexual behavior which is properly given and related to the norms prevailing in society. This Community Service aims to provide knowledge for children to know personal areas that must be protected from others and children can protect themselves from the crimes that are around them by refusing from behaviors that are not liked by children such as saying "no", “don’t” and "please". The results of the activities held in the form of teaching sexual education from an early age to children at the Raudhatul Athfal Islamic Kindergarten, the children know the areas of their private bodies that should not be touched by others except themselves, fathers, and mothers and children can reject the behavior disliked by children. Children can point out which areas of the body are not allowed by others and tell who can touch them.
Bentuk Lingual dalam Meme pada Grup Whatsapp Rachmawati, Dian; Imbang, Djeinnie; Kalangi, Leika Maria Victoria
Kajian Linguistik Vol 6, No 3 (2019)
Publisher : Universitas Sam Ratulangi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35796/kaling.6.3.2019.23657

Abstract

This study examines the lingual forms especially the morphological process and the lingual form of sentences based on the communicative values contained in the meme of the whatsapp group. The things discussed will reveal the lingual forms of words and sentences in meme on whatsapp group. This study aims to identify, classify, and analyze the lingual forms in meme on whatsapp group. This research is descriptive qualitative with a linguistic approach. The method of data collection uses the referred method. The method of data analysis uses a matching method with basic and advanced techniques. The results of the study show that there are six lingual forms of words according to the morphological processes in the meme of the whatsapp group, which consist of zero derivation, affixation (prefix, suffix, confix, and combination of affixes), reduplication (dwilingga and dwiwasana), abbreviation (decapitation, abbreviation, contractions, and acronyms), composition, and reverse derivation. The result of the study of the lingual sentence shows that there are four types of sentences, namely declarative sentences, interrogative sentences (total and partial interrogatives), imperative sentences (common imperatives, requests, invitation, and imperative), and empathic sentences in meme on whatsapp group.Keywords: shapes, lingual, words, sentences, memes
TINDAK TUTUR ILOKUSI DALAM ACARA KUIS “WIB” EPISODE 9 JULI 2018 DI NET TV Rachmawati, Dian
Kajian Linguistik Vol 5, No 3 (2018)
Publisher : Universitas Sam Ratulangi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35796/kaling.5.3.2018.24775

Abstract

The illocutionary acts is a speech act aiming at not only to convey something but also to do something in the form of speech. Speech is not only used to express something because everyone who speaks has a purpose in every speech. The problem studied in this pragmatic research is forms of  illocutionary acts in WIB program in episode 9 July 2018. The purpose of this research is to describe the forms of s illocutionary acts in WIB program in episode 9 July 2018. The method used in this study is qualitative descriptive. Method of data collection using the observation method  by using basic techniques, which is observation technique. Furthermore, observation technique is followed with advanced techniques in the form  of uninvoluement observation capable of recording, record, and record techniques. The analysis of this research using the method of equalextralingua. Based on the result of the research, it can be concluded that the illocutionary acts in WIB program on July 9, 2018 episode, on Net TV, support Searle concept by discovery five types of illocutionary acts, namely representative, commissive, directive, expressive, and declarative.Keywords: acts of speech, act of speech illocution, quiz WIB 
Analisis dan Implementasi Kompresi File Audio Dengan Menggunakan Algoritma Run Length Encoding (RLE) Aditya Rahandi; Dian Rachmawati; Sajadin Sembiring
Alkhawarizmi Vol 1, No 1 (2012): Jurnal Alkhawarizimi
Publisher : Alkhawarizmi

Show Abstract | Download Original | 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 Evi Mariani Harahap; Dian Rachmawati; Herriyance Herriyance
Alkhawarizmi Vol 1, No 1 (2012): Jurnal Alkhawarizimi
Publisher : Alkhawarizmi

Show Abstract | Download Original | 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%.
Pengembangan Computer-Based Test Sebagai Strategi Peningkatan Efisiensi Evaluasi Kegiatan Belajar Mengajar Dedy Arisandi; Dian Rachmawati; Indra Aulia; Seniman Seniman
Juripol (Jurnal Institusi Politeknik Ganesha Medan) Vol. 1 No. 1 (2018): Jurnal Institusi Politeknik Ganesha Medan (Juripol) Januari 2018
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | 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.
On Factoring The RSA Modulus Using Tabu Search Ade Candra; Mohammad Andri Budiman; Dian Rachmawati
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 | Download Original | Original Source | Check in Google Scholar | Full PDF (468.763 KB) | DOI: 10.32734/jocai.v1.i1-65

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 Mohammad Andri Budiman; Dian Rachmawati
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 | Download Original | Original Source | Check in Google Scholar | Full PDF (1163.568 KB) | DOI: 10.32734/jocai.v2.i1-91

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.
PERBANDINGAN ALGORITMA MESSAGE DIGEST-5 (MD5) DAN GOSUDARSTVENNYI STANDARD (GOST) PADA HASHING FILE DOKUMEN Marthin Benedict; Mohammad Andri Budiman; Dian Rachmawati
JTIK (Jurnal Teknik Informatika Kaputama) Vol 1, No 1 (2017)
Publisher : STMIK KAPUTAMA

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

Abstract

Dokumen elektronik memiliki sifat terbuka, artinya isi dokumen dapat dibaca dan diubah dengan mudah olehpihak-pihak yang tidak berhak. Hal tersebut menyebabkan integritas dokumen menjadi tidak terjamin. Integritasdokumen elektronik dapat dijamin dengan menggunakan teknik kriptografi, salah satunya hash function. Adabanyak algoritma yang dapat digunakan untuk hashing file atau dokumen, dua algoritma diantaranya adalahalgoritma Message Digest-5 (MD5) dan algoritma Gosudarstvennyi Standard (GOST). Secara garis besar,kedua algoritma mengambil panjang isi file atau pesan dalam bit lalu dibagi menjadi blok-blok bit setelah itupada setiap blok akan dilakukan operasi matematika sehingga menghasilkan 128 bit nilai hash pada MessageDigest-5 (MD5) dan 256 bit nilai hash pada Gosudarstvennyi Standard (GOST). Setelah itu, nilai hash diubahdalam bentuk heksadesimal sehingga Message Digest-5 (MD5) akan menghasilkan 32 karakter heksadesimalnilai hash dan 64 karakter heksadesimal nilai hash pada Gosudarstvennyi Standard (GOST).