Garuda - Garba Rujukan Digital

p-Index From 2021 - 2026

2.795

P-Index

This Author published in this journals

All Journal Seminar Nasional Aplikasi Teknologi Informasi (SNATI) JIPI (Jurnal Ilmu Perpustakaan dan Informasi) Sinkron : Jurnal dan Penelitian Teknik Informatika Data Science: Journal of Computing and Applied Informatics JTIK (Jurnal Teknik Informatika Kaputama) Jurnal Sistem Komputer dan Informatika (JSON) Journal of Applied Data Sciences International Journal of Basic and Applied Science

Mohammad Andri Budiman

Master Of Informatics Program, Faculty Of Computer Science And Information Technology, Universitas Sumatera Utara, Medan, Indonesia

Author-ID : 321373

Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Electrical & Electronics Engineering Library & Information Science Physics

Published : 29 Documents Claim Missing Document

Claim Missing Document

Articles

1 2 3

Teknik Pemecahan Kunci Algoritma Rivest Shamir Adleman (RSA) dengan Metode Kraitchik Muchlis, Budi Satria; Budiman, Mohammad Andri; Rachmawati, Dian
Sinkron : jurnal dan penelitian teknik informatika Vol. 2 No. 1 (2017): SinkrOn Volume 2 Nomor 1 Oktober 2017
Publisher : Politeknik Ganesha Medan

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

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.

Penggunaan Algoritma RSA dengan Metode The Sieve of Eratosthenes dalam Enkripsi dan Deskripsi Pengiriman Email Muhammad Safri Lubis; Mohammad Andri Budiman; Karina Lolo Manik
Seminar Nasional Aplikasi Teknologi Informasi (SNATI) 2013
Publisher : Jurusan Teknik Informatika, Fakultas Teknologi Industri, Universitas Islam Indonesia

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

Dewasa ini sistem informasi semakin berkembang. Hal ini dapat dilihat dari kemajuan teknologi dalam proses komunikasi yang dapat dilakukan secara jarak jauh dari dua tempat yang berbeda. Perkembangan teknologi telekomunikasi dengan menggunakan komputer menyebabkan mobilitas masyarakat semakin baik karena komunikasi bisa dilakukan tanpa perlu interaksi langsung satu sama lain. Berbagai jenis layanan komunikasi tersedia di internet seperti pengiriman pesan melalui email yang semakin diminati oleh masyarakat. Meningkatnya pemanfaatan layanan e-mail melalui internet menyebabkanpermasalahan juga bermunculan selain permasalahan adanya hacker dan cracker. Hal tersebut sangat memungkinkan pesan yang dikirim dapat disadap dan diubah oleh pihak lain. Salah satu bentuk pencegahan kejahatan di internet adalah dengan menggunakan algoritma kunci publik RSA, yaitu dengan cara mengenkripsi pesan yang akan dikirim menggunakan kunci publik yang telah dibangkitkan oleh pihak pengirim. Cara ini akan memperkuat tingkat keamanan pesan yang dikirim dalam suatu jaringan internet selama kunci privat terjaga kerahasiaannya. Oleh karena itu, algoritma RSA akan diterapkan pada suatu perangkat lunak yang dirancang dan dibuat mengunakan bahasa pemrograman Visual Basic .NET 2008 sebagai sarana untuk meningkatkan keamanan pengiriman pesan.

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

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.

Implementation and comparison of Berry-Ravindran and Zhu- Takaoka exact string matching algorithms in Indonesian-Batak Toba dictionary Efelin Siburian; Mohammad Andri Budiman; Jos Timanta
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

Indonesia has a variety of local languages, which is the Batak Toba language. This time, there are still some Batak Toba people who do not know speak Batak Toba language fluently. Nowadays, desktop based dictionary is one of reference that very efficiently used to learn a language and also to increase vocabulary. In making the dictionary application, string matching can be implemented for word-searching process. String matching have some algorithm, which is Berry – Ravindran algorithm and Zhu-Takaoka algorithm and will be implemented on the dictionary application. Zhu-Takaoka algorithm and Berry – Ravindran algorithm have two phases, which are the preprocessing phase and the searching phase. Preprocessing phase is a process to make the shifting values according to in pattern that input by user. To know the shifting value with Zhu-Takaoka algorithm, it’s need Zhu-Takaoka Bad Character (Ztbc) and Boyer-Moore Good Suffix (Bmgs). Then, Ztbc will be compared to Bmgs to get the maximum value of them that will be set as shifting value. While Berry-Ravindran algorithm, to know the shifting value is needed Berry-Ravindran Bad Character, which the two characters right of the text at the position m + 1 and m+ 2, is needed to determine the shifting value, where m is length of the pattern.

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

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.

Computing the Value of Pi in the Manner of Lambda Function with R Statistical Programming Language Muhammad Reza Fahlevi; Mohammad Andri Budiman
Data Science: Journal of Computing and Applied Informatics Vol. 5 No. 1 (2021): Data Science: Journal of Computing and Applied Informatics (JoCAI)
Publisher : Talenta Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32734/jocai.v5.i1-5556

The value of π is one of the famous mathematical constant, not only to mathematicians, but also to physicists and to engineers. Numerous algorithm is used to compute what is the value of π, but most of programmer do not use lambda function and neglect the aesthetic of their script. This study aims to compute the value π by write it first as infinite series using Riemann sum, and then the computing of it is conducted in R programming language. We involved the role of anonymous function or known as lambda function to make the R code is more beautiful, artistic, and elegant.

Perbandingan Algoritma Greedy dan Hill Climbing Untuk Menentukan Fasilitas Kesehatan Tingkat Pertama (FKTP) Terdekat Bagi Peserta BPJS Kesehatan Dhea Fithaloka; Mohammad Andri Budiman; Dian Rachmawati
JTIK (Jurnal Teknik Informatika Kaputama) Vol 1, No 2 (2017)
Publisher : STMIK KAPUTAMA

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

Kebutuhan pencarian Fasilitas Kesehatan Tingkat Pertama di Kota Medan termasuk cukup besar,dimana Fasilitas Kesehatan Tingkat Pertama melayani sesuai keluhan pasien, seperti penyakit umum,rawat jalan dan rawat inap, konsultasi, obat-obat dan lain sebagainya. Terdapat pilihan wilayah yangdapat ditempuh untuk menuju Fasilitas Kesehatan Tingkat Pertama terdekat yang diinginkan, terdapat21 wilayah Fasilitas Kesehatan Tingkat Pertama di kota medan. Dalam pencarian Fasilitas KesehatanTingkat Pertama terdekat di Kota Medan tersebut akan diterapkan kedalam sebuah graf. Dalammenyelesaikan graf diperlukan pula algoritma, algoritma yang akan digunakan yaitu algoritma HillClimbing dan algoritma Greedy, dimana algoritma Hill Climbing adalah suatu metode untuk mencaridan menentukan rute yang paling singkat dengan memperkecil tempat yang disinggahi denganmenggunakan cara heuristic dan algoritma Greedy memberikan solusi memecahkan masalah denganmembuat pilihan optimum lokal. Berdasarkan Hasil pencarian Fasilitas Kesehatan Tingkat Pertama diKota Medan dengan menggunakan algoritma Hill Climbing dan algoritma Greedy menunjukkan hasilyang berbeda dan running time yang berbeda dimana algoritma Hill Climbing memiliki nilai runningtime yang lebih cepat serta menunjukkan hasil yang sesuai dengan tujuan dibandingkan algoritmaGreedy.

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)

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).

Signcryption with Matrix Modification of RSA Digital Signature Scheme and Cayley-Purser Algorithm Ginting, Cindy Laurent; Budiman, Mohammad Andri; Nasution, Sawaluddin
Data Science: Journal of Computing and Applied Informatics Vol. 8 No. 1 (2024): Data Science: Journal of Computing and Applied Informatics (JoCAI)
Publisher : Talenta Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32734/jocai.v8.i1-12226

The sender must ensure the security of messages and authenticated messages in messaging communications. Additionally, the sender must guarantee the message's integrity and cannot deny its authenticity or involvement with the message. This aspect is more robust because the recipient can verify, ensuring that the message originates from an authorized sender. In addition to this crucial aspect, the Signcryption method employing the Matrix Modification of RSA Digital Signature Scheme and the Cayley-Purser Algorithm can accomplish both of the objectives of this study. Encrypt-then-sign is the Signcryption method used, and the MD5 hash function performs one-way hashing during the signing procedure to enhance message security. This study tested the message plaintext in the form of a collection of strings consisting of uppercase (capital), lowercase (small), numbers (numeric), and other punctuation characters with varying numbers of characters in each string, as well as the value of modulus n from 10 digits up to its maximum length, which is unconstrained. The test results indicate that the time required for encryption and decryption is proportional to the number of plaintext characters used.

A Hybrid Cryptosystem Using Rprime RSA And Extended Tiny Encryption (XTEA) For Securing Message Santoso, Zikri Akmal; Budiman, Mohammad Andri; Efendi, Syahril
Data Science: Journal of Computing and Applied Informatics Vol. 9 No. 1 (2025): Data Science: Journal of Computing and Applied Informatics (JoCAI)
Publisher : Talenta Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32734/jocai.v9.i1-16574

Abstract. Ensuring the security of messages in sending message publicly is very important, we must ensure the security of messages with one of security method called cryptography. Focusing solely on security can affect the speed of message delivery processes. Therefore, this research is conducted to provide solutions to both of these issues. Thus, this research will discuss the Analysis of Hybrid Cryptography Scheme in the combination of RPrime RSA and XTEA (Extended Tiny Encryption) in securing instant messages. Hybrid cryptography is one of the methods in cryptography that allows to enhance speed of message delivery with messages encrypted by symmetric algorithms and the symmetric algorithm keys will be encrypted using asymmetric algorithms, public keys. RPrime RSA is an asymmetric public key algorithm and one variant of RSA, which is a combination of Rebalanced RSA and MPrime RSA algorithms. XTEA is a symmetric key algorithm and improved version of the TEA algorithm. This research tested by using strings with uppercase letter, numeric, and punctuation characters with the value of k in RPrime RSA from 2 to 6 with unconstrained modulus digits. The result of the test indicate that the required time for encryption and decryption is proportional, the time processing for factorization to get d is proportional to the value of k.

Co-Authors Ade Candra Amalia Amalia Amalia Amalia Amalia Amer Sharif Benedict, Marthin Budi Satria Muchlis, Budi Satria Dhea Fithaloka Dian Rachmawati Dian Rachmawati Efelin Siburian Efendi, Syahril Efori Bu'ulolo Elviawaty Muisa Zamzami Fithaloka, Dhea Ginting, Cindy Laurent Handrizal Hanna Willa Dhany Hidayati, Indri Imanuel Zega Joceline Schellenberg W Jonson Manurung Jos Timanta Jos Timanta Tarigan Juanda Hakim Lubis Karina Lolo Manik Khairul Abdi Mahyuddin K. M Nasution Marthin Benedict Muchtar, Muhammad Anggia Muhammad Ardiansyah Sembiring Muhammad Reza Fahlevi Muhammad Safri Lubis Muhammad Yogi Saputra Muhammad Zarlis Muhammad Zarlis, Muhammad Nur Hayati Pangaribuan, Timotius Poltak Sihombing Poltak Sihombing Purwanto Simamora Santoso, Zikri Akmal Sarumaha, Demonius Sawaluddin Nasution Sutarman Sutarman Sutarman Sutarman T.Henny Febriana Harumy W, Joceline Schellenberg

Title

Found 29 Documents
Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title Search

Found 29 Documents Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 29 Documents
Search