Articles
<![CDATA[Teknik Pemecahan Kunci Algoritma Rivest Shamir Adleman (RSA) dengan Metode Kraitchik ]]>
<![CDATA[Muchlis, Budi Satria]]>;
<![CDATA[Budiman, Mohammad Andri]]>;
<![CDATA[Rachmawati, Dian]]>
<![CDATA[ Sinkron : jurnal dan penelitian teknik informatika Vol. 2 No. 1 (2017): SinkrOn Volume 2 Nomor 1 Oktober 2017 ]]>
Publisher : <![CDATA[Politeknik Ganesha Medan ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (1104.819 KB)
<![CDATA[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.]]>
<![CDATA[Penggunaan Algoritma RSA dengan Metode The Sieve of Eratosthenes dalam Enkripsi dan Deskripsi Pengiriman Email ]]>
<![CDATA[Muhammad Safri Lubis]]>;
<![CDATA[Mohammad Andri Budiman]]>;
<![CDATA[Karina Lolo Manik]]>
<![CDATA[ Seminar Nasional Aplikasi Teknologi Informasi (SNATI) 2013 ]]>
Publisher : <![CDATA[Jurusan Teknik Informatika, Fakultas Teknologi Industri, Universitas Islam Indonesia ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
<![CDATA[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.]]>
<![CDATA[Perbandingan Algoritma Greedy dan Hill Climbing Untuk Menentukan Fasilitas Kesehatan Tingkat Pertama (FKTP) Terdekat Bagi Peserta BPJS Kesehatan ]]>
<![CDATA[Dhea Fithaloka]]>;
<![CDATA[Mohammad Andri Budiman]]>;
<![CDATA[Dian Rachmawati]]>
<![CDATA[ JTIK (Jurnal Teknik Informatika Kaputama) Vol 1, No 2 (2017) ]]>
Publisher : <![CDATA[STMIK KAPUTAMA ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (1024.914 KB)
<![CDATA[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.]]>
<![CDATA[Signcryption with Matrix Modification of RSA Digital Signature Scheme and Cayley-Purser Algorithm ]]>
<![CDATA[Ginting, Cindy Laurent]]>;
<![CDATA[Budiman, Mohammad Andri]]>;
<![CDATA[Nasution, Sawaluddin]]>
<![CDATA[ Data Science: Journal of Computing and Applied Informatics Vol. 8 No. 1 (2024): Data Science: Journal of Computing and Applied Informatics (JoCAI) ]]>
Publisher : <![CDATA[Talenta Publisher ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.32734/jocai.v8.i1-12226
<![CDATA[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.]]>
<![CDATA[A Hybrid Cryptosystem Using Rprime RSA And Extended Tiny Encryption (XTEA) For Securing Message ]]>
<![CDATA[Santoso, Zikri Akmal]]>;
<![CDATA[Budiman, Mohammad Andri]]>;
<![CDATA[Efendi, Syahril]]>
<![CDATA[ Data Science: Journal of Computing and Applied Informatics Vol. 9 No. 1 (2025): Data Science: Journal of Computing and Applied Informatics (JoCAI) ]]>
Publisher : <![CDATA[Talenta Publisher ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.32734/jocai.v9.i1-16574
<![CDATA[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.]]>
<![CDATA[Segmentasi Nasabah Bank Pada Data Campuran Menggunakan K-Means Clustering ]]>
<![CDATA[W, Joceline Schellenberg]]>;
<![CDATA[Budiman, Mohammad Andri]]>;
<![CDATA[Amalia, Amalia]]>
<![CDATA[ Jurnal Sistem Komputer dan Informatika (JSON) Vol 6, No 3 (2025): Maret 2025 ]]>
Publisher : <![CDATA[Universitas Budi Darma ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.30865/json.v6i3.8532
<![CDATA[In order to increase the extension of the use of Local Government Banks’s services, customer segmentation is crucial for banks to develop marketing strategies tailored to specific customer groups. While the RFM model is commonly used, enhancing service usage expansion requires data on customer transaction preferences, which are typically categorical in nature. Therefore, this study segments bank customers based on their transaction history, utilizing not only numerical data but also categorical data representing transaction preferences using K-Means Clustering. The clustering model effectively groups customers into four clusters with distinct characteristics]]>
<![CDATA[A Hybrid Cryptosystem Using Vigenère Cipher and Rabin-p Algorithm in Securing BMP Files ]]>
<![CDATA[Budiman, Mohammad Andri]]>;
<![CDATA[Muhammad Yogi Saputra]]>;
<![CDATA[Handrizal]]>
<![CDATA[ Data Science: Journal of Computing and Applied Informatics Vol. 4 No. 2 (2020): Data Science: Journal of Computing and Applied Informatics (JoCAI) ]]>
Publisher : <![CDATA[Talenta Publisher ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.32734/jocai.v4.i2-4173
<![CDATA[Vigenère cipher is a classical cryptography algorithm and similar to other classical algorithms, it produces smaller but less secure ciphertexts than a public key cryptography algorithm. Meanwhile, Rabin-p is a public key cryptography algorithm with a stronger encryption than Vigenère cipher. Nevertheless, as a public key algorithm, Rabin-p is inefficient to encrypt vast amounts of messages such as BMP image files, since the size of the cipherimages will increase manyfold and this would lead to a problem in storing and sending the cipherimages. To overcome these problems, in this study, we combined the Vigenère cipher and the Rabin-p algorithm in a hybrid cryptosystem scheme. In the experiment, the Vigenère cipher was used to encrypt the BMP files and the Rabin-p algorithm was used to encrypt the Vigenère keys. The result showed that the size of the cipherimages did not increase and the decryption procedure could recover the original BMP files while maintaining their integrity.]]>
<![CDATA[Analysis of Embedding Locations in the Subband Frequency DCT on Scanned Images ]]>
<![CDATA[Hidayati, Indri]]>;
<![CDATA[Budiman, Mohammad Andri]]>;
<![CDATA[Zarlis, Muhammad]]>
<![CDATA[ Data Science: Journal of Computing and Applied Informatics Vol. 7 No. 1 (2023): Data Science: Journal of Computing and Applied Informatics (JoCAI) ]]>
Publisher : <![CDATA[Talenta Publisher ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.32734/jocai.v7.i1-10359
<![CDATA[Uploading an identity card as an image for the account verification process or transactions online can be a threat to application users. Identity card theft can be carried out by irresponsible persons if the application can be hacked. Therefore, protection of the image is required for authentication. In this study, the proposed technique is watermarking. A watermark in the form of a binary image will be embedded into the image as ownership using a Discrete Cosine Transform. The Discrete Cosine Transform works in the frequency domain. The location of the embedding of different watermarks was analysed in each 8×8 DCT block. The results of the analysis to assess the imperceptibility of original images and watermarked images using PSNR (Peak Signal to Noise Ratio) and SSIM (Structural Similarity Index Measure), while assessing the watermark robustness embedded using NCC (Normalized Cross Correlation). The results show PSNR (Peak Signal to Noise Ratio) ≥ 54 dB with a watermark strength of 0,1 and an average SSIM (Structural Similarity Index Measure) ≥ 0,9 on 4 scanned images in BMP format with a resolution of 100 DPI. A good watermark embedding is done on the green component at middle frequencies to maintain a balance between imperceptibility and robustness. In contrast, the red component at low frequency is vulnerable to attacks in the form of brightness +20 and contrast +50 with an average NCC (Normalized Cross Correlation) ≤ 0,85.]]>
<![CDATA[Comparative Analysis of Ciphertext Enlargement on Generalization of the ElGamal and Multi-factor RSA ]]>
<![CDATA[Zega, Imanuel]]>;
<![CDATA[Mohammad Andri Budiman]]>;
<![CDATA[Syahril Efendi]]>
<![CDATA[ Data Science: Journal of Computing and Applied Informatics Vol. 7 No. 1 (2023): Data Science: Journal of Computing and Applied Informatics (JoCAI) ]]>
Publisher : <![CDATA[Talenta Publisher ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.32734/jocai.v7.i1-10360
<![CDATA[Information and communication security has become more crucial and has become a new problem in relation to security, accessibility, data management, and other information policy challenges as a result of how easy it is for all users to use communication media. One of the fields of science that has a technique or art for disguising the data sent by the sender to the recipient with the aim of maintaining the confidentiality of the data is called cryptography. In determining better cryptographic algorithms for data security systems, in addition to considering strength, key length and ciphertext enlargement are also important factors to consider. Therefore, in this study, we attempted to compare the ciphertext magnification of the generalization of the ElGamal and multi-factor RSA algorithms by utilizing the same key length. Generalization of the ElGamal and Multi-factor RSA are both asymmetric algorithms that have public and private key pairs for encryption and decryption. However, at the level of security, the RSA algorithm is based on the difficulty of finding large integer factors into two prime factors. In contrast to the ElGamal algorithm, security is based on the difficulty of calculating the discrete logarithm of a large prime modulus. The results of the comparison algorithm carried out are represented in the form of a table containing the plaintext, key length, and size of the data.]]>
<![CDATA[Performance Analysis of Hybrid Cryptographic Algorithms Rabbit Stream and Enhanced Dual RSA ]]>
<![CDATA[Sarumaha, Demonius]]>;
<![CDATA[Mohammad Andri Budiman]]>;
<![CDATA[Muhammad Zarlis]]>
<![CDATA[ Data Science: Journal of Computing and Applied Informatics Vol. 7 No. 1 (2023): Data Science: Journal of Computing and Applied Informatics (JoCAI) ]]>
Publisher : <![CDATA[Talenta Publisher ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.32734/jocai.v7.i1-10483
<![CDATA[Cryptography is a technique for encoding data by encrypting plaintext into an unreadable (meaningless) form. Cryptographic methods have good and bad performance depending on the type of algorithm we use. Therefore, the purpose of this study is to measure speed by combining the two algorithms used. The Rabbit Stream algorithm is a stream cipher algorithm whose system security depends on the generation of a key bit stream (keystream), which only guarantees 128-bit key security but has the advantage of being fast in the encryption and decryption process, while the Enhanced Dual RSA algorithm is an asymmetric algorithm to increase data protection from the Dual RSA algorithm by utilizing the Pells equation as a substitute for public key exponents. On the other hand, the algorithm in question requires a significant amount of time to encrypt messages with a large capacity when compared to the Rabbit Stream algorithm. Nonetheless, the study's findings suggest that using a hybrid method is comparatively faster for processing substantial amounts of data.]]>
