Article Per Year (5 Year)
p-Index From 2020 - 2025
3.799
P-Index
This Author published in this journals
All Journal CAUCHY: Jurnal Matematika Murni dan Aplikasi Cyber Security dan Forensik Digital (CSFD) Jurnal Riset Mahasiswa Matematika Journal of Research on Community Engagement
Muhammad Khudzaifah
Unknown Affiliation
Humanities Computer Science & IT Mathematics Social Sciences

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

Found 24 Documents
Search

 1   2   3 
Aplikasi quasigroup dalam pembentukan kunci rahasia pada algoritma hibrida Khudzaifah, Muhammad
CAUCHY Vol 3, No 2 (2014): CAUCHY
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (746.621 KB) | DOI: 10.18860/ca.v3i2.2573

Abstract

Pada artikel ini dibahas penerapan quasigrup di bidang kriptografi. Didefinisikan Suatu operasi quasigroup order 𝑝−1 sehingga bisa membentuk suatu algoritma kriptografi yang disebut sebagai quasigrup cipher, quasigrup cipher merupakan algoritma kriptografi simetris. Algoritma kriptografi simetris memiliki sistem keamanan lemah karena kunci yang digunakan untuk proses enciphering sama dengan kunci yang digunakan untuk proses deciphering. Sehingga pada artikel ini algoritma quasigroup cipher dimodifikasi dengan menggabungkannya dengan algoritma RSA menjadi suatu algoritma hibrida yang memiki dua tingkatan kunci
Penyandian Super Enkripsi Menggunakan Columnar Transposition dan Modifikasi Hill Cipher dengan Invers Kiri Matriks Persegi Panjang Wahyuni, Fika; Khudzaifah, Muhammad; Jauhari, Muhammad Nafie
Jurnal Riset Mahasiswa Matematika Vol 1, No 2 (2021): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/jrmm.v1i2.14224

Abstract

Pada penelitian ini, digunakan algoritma columnar transposition sebagai metode transposisi dan modifikasi algoritma hill cipher dengan invers kiri matriks persegi panjang sebagai metode substitusi. Penyandian pesan menggunakan metode super enkripsi dengan algoritma columnar transposition dan modifikasi algoritma hill cipher dengan invers kiri matriks persegi panjang menghasilkan pesan akhir yang tidak mengubah, menambah maupun mengurangi pesan awal, sehingga dapat di implementasikan pada pesan dengan baik. Penyandian ini melipat gandakan keamanan suatu pesan, dimana keamanan pertama terletak pada enkripsi pesan dengan columnar transposition dan keamanan yang kedua terletak pada algoritma hill cipher yang telah dimodifikasi, sehingga membuat pesan akan semakin sulit untuk dipecahkan.   Hasil dari penelitian ini dapat dijadikan sebagai tambahan pustaka mengenai kriptografi serta solusi bagi pihak yang menggunakan teknologi informasi dan komunikasi untuk dapat melakukan pengiriman pesan dengan aman.
Implementasi Algoritma A-Star dalam Menentukan Rute Terpendek Destinasi Wisata Kota Malang Syihabuddin, Riyan Fahmi; Jauhari, Mohammad Nafie; Khudzaifah, Muhammad; Fahmi, Hisyam
Jurnal Riset Mahasiswa Matematika Vol 1, No 5 (2022): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/jrmm.v1i5.14497

Abstract

Traveling is one of the needs of everyone to relax the mind from the busyness that is lived every day. One of the cities in East Java which is a prima donna for traveling is Malang. The city has approximately 43 tourist destinations. Usually, tourists who want to visit not only one place, but several places. generate assistance in deciding which destinations to visit first in order for their trip to be effective. The shortest search process in this study uses the A-Star Algorithm, one of the BFS algorithms which in the process really considers the heuristic value. The process of testing the shortest route is done by selecting a starting point, then selecting several tourist locations. Next, the shortest route will be searched using the A-star algorithm at each destination, then which destination will be visited first. And so on until the final destination. The effectiveness of the route which involves comparison with the route presented by google maps. Based on the results of 30 experiments on several comprehensive destinations, it was found that the average route search using the A-Star algorithm was 44.17% shorter than that presented on google maps. This is due to the uniqueness of the algorithm in which there is a heuristic value and selection for each destination so as to make the route more effective.
Penyandian Pesan Hybrid dengan Myszkowski Cipher dan Rivest, Shamir, Adleman (RSA) Safitri, Sukmawati Indah; Khudzaifah, Muhammad; Jauhari, Mohammad Nafie
Jurnal Riset Mahasiswa Matematika Vol 2, No 6 (2023): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/jrmm.v2i6.22017

Abstract

Classical and modern cryptography have advantages and disadvantages in securing text messages. Hybrid algorithms can combine two algorithms to produce a higher level of message security when compared to one type of algorithm. This study discusses a hybrid algorithm that combines Myszkowski Cipher and RSA. The purpose of this research is to obtain ciphertext that is more difficult to crack by cryptanalysis. The hybrid algorithm process is done by encrypting text messages with the Myszkowski Cipher algorithm then the key used in the Myszkowski Cipher algorithm are encrypted using the RSA algorithm with the equation . Then the ciphertext and cipherkey will be obtained in numerical. The decryption process is done by decrypting the cipherkey by specifying the value of  as the private key so that  using the equation . Next is by trying the value of  until a  value is obtained, after which decryption to the equation , then the process of decrypting ciphertext using Myszkowski Cipher can be done. The benefit of this research is can improve the security of messages because it applies the advantages of each algorithm in its encoding.
Indeks Harmonik dan Indeks Gutman Graf Nilradikal pada Gelanggang Komutatif dengan Satuan Afifah, Luluk; Sujarwo, Imam; Khudzaifah, Muhammad
Jurnal Riset Mahasiswa Matematika Vol 2, No 4 (2023): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/jrmm.v2i4.14902

Abstract

Graph theory is a topic that is still an important subject to discuss. This is because until now graph theory has many practical applications in various disciplines, for example in biology, computer science, economics, informatics engineering, linguistics, mathematics, health, and social sciences. This study discusses the Gutman index of nilradical graphs in the commutative ring with unity.A nilradical graph whose vertices are non-zero nilpotent elements, when the domain is a commutative ring with units, it forms a complete graph only if the commutative ring with units we use is limited to a positive integer modulo n (Z_n). Where n is the square of the prime number p which is less than equal to 3. It is known that the general pattern of harmonic indices and Gutman indices of nilradical graphs in the commutative ring with unity are H(N(Z_(n=p^2 ) ))=((p-2)^2+(p -2))/2(p-2) and Gut(N(Z_(n=p^2 ) ))=(1/2 ((p-2)^2+(p-2))) (p- 2)^2 respectively. In its application, this general form can be used as a numerical parameter of a graph in chemical graph theory, molecular topology, and mathematical chemistry.
Implementasi Fungsi Hash MD5 dan Kriptografi Algoritma RSA pada Pembuatan Tanda Tangan Digital HR, Annisa Hardiningsih; Khudzaifah, Muhammad; Jauhari, M. Nafie
Jurnal Riset Mahasiswa Matematika Vol 1, No 2 (2021): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/jrmm.v1i2.13992

Abstract

Pada penelitian ini dibahas penerapan tanda tangan digital sebagai bentuk penjagaan keontentikan suatu dokumen elektronik yang dibuat dengan menggabungkan dua algoritma, yaitu fungsi hash MD5 (Message Digest 5) dan RSA (Rivest Shamir Adleman).  Isi dokumen elektronik diberikan fungsi hash MD5 sehingga menghasilkan message digest. Selanjutnya message digest akan dienkripsikan menggunakan algoritma kriptografi RSA sehingga menghasilkan tanda tangan digital. Hasil pengujian menunjukkan bahwa tanda tangan digital yang dihasilkan adalah berbeda-beda dari setiap dokumen elektronik. Dokumen elektronik yang menghasilkan nilai dekripsi tanda tangan digital dan message digest modulo  yang sama menunjukkan bahwa dokumen elektronik tidak mengalami perubahan pada isinya. Sebaliknya, dokumen elektronik yang tidak menghasilkan nilai dekripsi dan tanda tangan digital dan message digest modulo  yang sama menunjukkan bahwa dokumen elektronik telah mengalami perubahan pada isinya.
Analisis Frekuensi Ciphertext dengan Algoritma Kriptografi DNA dan Transformasi Digraf Faizah, Widya Nur; Khudzaifah, Muhammad; Ismiarti, Dewi
Jurnal Riset Mahasiswa Matematika Vol 1, No 6 (2022): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/jrmm.v1i6.14591

Abstract

DNA Cryptography is one of new algortihm in cryptography that is used to encrypt the data by converting the DNA code into binary code. Encryption process is expected to produce a random and unreadable ciphertext. This research aims to determine the result of encryption frequency analysis of the ciphertext obtained from the encryption process using DNA Cryptography and Digraph Transformation algorithm. The formation of a symmetric key is carried out for the encryption and decryption process in DNA Cryptography, and modular arithmetic in Digraph Transformation algorithm. The encryption process produces ciphertext in the form of letters and symbols because if involves the use of an ASCII table. Frequency analysis is done by comparing the frequency of occurence of letters in the ciphertext with frequency of occurence of letters in English. The conclusion for this research is that the ciphertext looks random, not easy to read, and hard to guess. For the future work, researcher can change the choice of binary code combinatory in DNA Cryptographic algorithms, increase the character vocabulary in the Digraph Transformation algorithm, and use various languages to code.
Membangun Super Enkripsi untuk Mengamankan Pesan Agustina, Laura; Sujarwo, Imam; Khudzaifah, Muhammad
Jurnal Riset Mahasiswa Matematika Vol 2, No 5 (2023): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/jrmm.v2i5.21036

Abstract

The issue of message security or an information is very important. A science that studies aboutsecuring the confidentiality of messages using passwords is called cryptography. To enhance security, twoalgorithmsarecombinedtosecuremessages.Superencryptionisaconceptthatusesacombinationoftwoormoresubstitutionandpermutation(transposition)cryptographytechniquestoobtainanalgorithmthatis more difficult to crack. The first thing to do is to encrypt the message using a substitution technique(Cipher Substitution), then re-encrypt it using a permutation technique (Cipher Transposition). In thisstudy, two cryptographic algorithms will be combined to build super encryption using the Vigenere Cipherand Bifid Cipher algorithms to secure messages. The message encryption process is using the VigenereCipher algorithm for the first encryption process, then continued using the Bifid Cipher algorithm for thesecondencryptionprocess.Theencryptionprocessisdonetheotherwayaround,startingfromthebackoftheencryptionprocess.Thecombinationofthesetwoalgorithmsresultsinmoresecuremessagesecurity.
Enkripsi dan Dekripsi Pesan Menggunakan Polinomial Galois Field dengan Algoritma Hill Cipher Vega, Amelia; Sujarwo, Imam; Khudzaifah, Muhammad
Jurnal Riset Mahasiswa Matematika Vol 2, No 2 (2022): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/jrmm.v2i2.15150

Abstract

An information is extremely easy to obtain when technology is evolving so fast and it is important to secure the information to avoid irresponsible parties who want to abuse it. Messages that are not safe will harm the owner of the message, therefore a lot of research is related to message security. This study aims to deepen the message security in encoded form using Galois Field polynomials with one of the symmetric encryption algorithms, namely the Hill Cipher algorithm. Encryption is the process of converting a message into a secret code while decryption is the reverse process. The encryption and decryption process in this discussion is carried out by changing the message character into Galois Field polynomial form, then operating calculations based on the Hill Cipher algorithm, and then changing the results of the calculation operations into character form again. Based on the modifications have been made, the encryption and decryption formulas will be multiplied by modulo in polynomials form. In this study, the encryption and decryption keys are in matrix form with elements in it are members of the Galois Field polynomial and the result is a random message of 256 characters in binary bit-8. From this research, we gain insight into the encoding that can be done using polynomials which can be used later in other forms of encoding.
Kriptografi Hibrida Cipher Block Chaining (CBC) dan Merkle-Hellman Knapsack untuk Pengamanan Pesan Teks Novianti, Chofifah Alfin; Khudzaifah, Muhammad; Jauhari, Mohammad Nafie
Jurnal Riset Mahasiswa Matematika Vol 3, No 1 (2023): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/jrmm.v3i1.22292

Abstract

A secret message is a message that can only be seen by those who are entitled. In its delivery, a procedure is needed to keep the secret message secure, which is called cryptography. This research uses hybrid cryptography Cipher Block Chaining (CBC) and Merkle-Hellman Knapsack. The purpose of this research is to find out the encryption and decryption process of hybrid cryptography Cipher Block Chaining (CBC) and Merkle-Hellman Knapsack. The stages in this research use a qualitative approach with the library research method. In the encryption process with CBC, plaintext is encrypted first and the result called ciphertext. Furthermore, the key and Initialization Vector (IV) from CBC are encrypted using Merkle-Hellman Knapsack by generating a public key first and producing cipherkey. In the decryption process cipherkey is first decrypted using Merkle-Hellman Knapsack by calculating the inverse modulo . The decryption process continues by decrypting ciphertext using CBC. The result of securing messages using hybrid cryptography Cipher Block Chaining (CBC) and Merkle-Hellman Knapsack has a higher level of security than using only one cryptographic algorithm. As for the future, this research can be used to expand knowledge about securing text messages using hybrid cryptography algorithm CBC and Merkle-Hellman Knapsack.
Co-Authors AA Sudharmawan, AA Afifah, Luluk Agustina, Laura Ainindita Aghniacakti Ari Kusumastuti Bakhruddin Fannani Cahyanti, Niken Dwi Chusnia, Aldina Laili Erna Herawati, Erna Evawati Alisah Fachrur Rozi Faizah, Widya Nur Hisyam Fahmi HR, Annisa Hardiningsih Imam Sujarwo Ismiarti, Dewi Juhari Juhari, Juhari Khoiriyah, Lili Ladunniyyah, Zakiyya Dzul Ludyawati, Ludyawati Mohammad Jamhuri Mohammad Nafie Jauhari Muhamad Sabilal Karim, Rifqi Novianti, Chofifah Alfin Pranata, Farahnas Imaniyah Rafika Zahrotul Fauziah Ria Dhea Layla Nur Karisma Sa'adati, Hawzah Safitri, Sukmawati Indah Siti Nur Fadlilah Syafi'ah, Nurus Syihabuddin, Riyan Fahmi Turmudi Usman Pagalay Vega, Amelia Wahyuni, Fika