Article Per Year (5 Year)
p-Index From 2021 - 2026
1.383
P-Index
This Author published in this journals
All Journal Seminar Nasional Aplikasi Teknologi Informasi (SNATI) Sinkron : Jurnal dan Penelitian Teknik Informatika Data Science: Journal of Computing and Applied Informatics Journal of Information Systems and Informatics JTIK (Jurnal Teknik Informatika Kaputama) Jurnal Sistem Komputer dan Informatika (JSON)
Mohammad Andri Budiman
Jurusan Ilmu Komputer Fakultas Ilmu Komputer Dan Teknologi Informasi, USU
Computer Science & IT Control & Systems Engineering

Published : 14 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 6 Documents
Search
Journal : Data Science: Journal of Computing and Applied Informatics

 1 
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

Abstract

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

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.
A Hybrid Cryptosystem Using Vigenère Cipher and Rabin-p Algorithm in Securing BMP Files Budiman, Mohammad Andri; Muhammad Yogi Saputra; Handrizal
Data Science: Journal of Computing and Applied Informatics Vol. 4 No. 2 (2020): 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.v4.i2-4173

Abstract

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.
Analysis of Embedding Locations in the Subband Frequency DCT on Scanned Images Hidayati, Indri; Budiman, Mohammad Andri; Zarlis, Muhammad
Data Science: Journal of Computing and Applied Informatics Vol. 7 No. 1 (2023): 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.v7.i1-10359

Abstract

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.
Comparative Analysis of Ciphertext Enlargement on Generalization of the ElGamal and Multi-factor RSA Zega, Imanuel; Mohammad Andri Budiman; Syahril Efendi
Data Science: Journal of Computing and Applied Informatics Vol. 7 No. 1 (2023): 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.v7.i1-10360

Abstract

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.
Performance Analysis of Hybrid Cryptographic Algorithms Rabbit Stream and Enhanced Dual RSA Sarumaha, Demonius; Mohammad Andri Budiman; Muhammad Zarlis
Data Science: Journal of Computing and Applied Informatics Vol. 7 No. 1 (2023): 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.v7.i1-10483

Abstract

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.
Co-Authors Amalia Amalia Amer Sharif, Amer Benedict, Marthin Budi Satria Muchlis, Budi Satria Dhea Fithaloka Dian Rachmawati Dian Rachmawati Efendi, Syahril Erna Budhiarti Nababan Fithaloka, Dhea Ginting, Cindy Laurent Handrizal Hidayati, Indri Imanuel Zega Karina Lolo Manik Muhammad Safri Lubis Muhammad Yogi Saputra Muhammad Zarlis Muhammad Zarlis, Muhammad Nur Hayati Santoso, Zikri Akmal Sarumaha, Demonius Sawaluddin Nasution Sitopu, Widya Astuti W, Joceline Schellenberg