Garuda - Garba Rujukan Digital

Implementasi Algoritma A-Star dalam Menentukan Rute Terpendek Destinasi Wisata Kota Malang Riyan Fahmi Syihabuddin; Mohammad Nafie Jauhari; Muhammad Khudzaifah; Hisyam Fahmi
Jurnal Riset Mahasiswa Matematika Vol 1, No 5 (2022): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

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.

Analisis Frekuensi Ciphertext dengan Algoritma Kriptografi DNA dan Transformasi Digraf Widya Nur Faizah; Muhammad Khudzaifah; Dewi Ismiarti
Jurnal Riset Mahasiswa Matematika Vol 1, No 6 (2022): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

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.

Enkripsi dan Dekripsi Pesan Menggunakan Polinomial Galois Field dengan Algoritma Hill Cipher Amelia Vega; Imam Sujarwo; Muhammad Khudzaifah
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

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.

Penggabungan Algoritma Hill Cipher dan ElGamal untuk Mengamankan Pesan teks Siti Nur Fadlilah; Turmudi Turmudi; Muhammad Khudzaifah
Jurnal Riset Mahasiswa Matematika Vol 1, No 5 (2022): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Hill Cipher is a one of the symmetric key cryptography algorithm that using an invertible matrix with an order n×n as a key to encrypt and decrypt plaintext. Meanwhile, ElGamal is other asymmetric key cryptography algorithm that use the complexity of discrete logarithms in the encryption and decryption process. In this study, the authors are interest in combine the Hill Cipher and ElGamal algorithms to secure text messages. The author use the matrix as a symmetric key and converts the plaintext in the table of ASCII 256. Then encrypt using the Hill Cipher algorithm which results the ciphertext from messages and ElGamal algorithm results the ciphertext of the symmetric key. In processing decryption using the ElGamal algorithm to determine the symmetric key that will be used as a key in the decryption process with the Hill Cipher algorithm so that the original plaintext is obtained. Then the results obtained are that the combination of the Hill Cipher and ElGamal algorithms to secure text messages can be done it well.

Membangun Super Enkripsi untuk Mengamankan Pesan Laura Agustina; Imam Sujarwo; Muhammad Khudzaifah
Jurnal Riset Mahasiswa Matematika Vol 2, No 3 (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.v2i3.16335

The issue of message security or an information is very important. A science that studies about securing the confidentiality of messages using passwords is called cryptography. To enhance security, two algorithms are combined to secure messages. Super encryption is a concept that uses a combination of two or more substitution and permutation (transposition) cryptography techniques to obtain an algorithm that is 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 this study, two cryptographic algorithms will be combined to build super encryption using the Vigenere Cipher and Bifid Cipher algorithms to secure messages. The message encryption process is using the Vigenere Cipher algorithm for the first encryption process, then continued using the Bifid Cipher algorithm for the second encryption process. The encryption process is done the other way around, starting from the back of the encryption process. The combination of these two algorithms results in more secure message security.

Membangun Super Enkripsi untuk Mengamankan Pesan Laura Agustina; Imam Sujarwo; Muhammad Khudzaifah
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.14470

The issue of message security or an information is particularly 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.

Indeks Harmonik dan Indeks Gutman Graf Nilradikal pada Gelanggang Komutatif dengan Satuan Luluk Afifah; Imam Sujarwo; Muhammad Khudzaifah
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

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.

Modifikasi Vigenere Cipher Menggunakan Grup Simetri untuk Mengamankan Pesan Teks Niken Dwi Cahyanti; Turmudi Turmudi; Muhammad Khudzaifah
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.16791

Cryptography is widely used to overcome information security problems that are exchanged on the internet network. One of the algorithms in cryptography is the Vigenere Cipher, the algorithm is known as a robust method and is not easily solved. However, the Vigenere Cipher algorithm has a weakness, namely the key is short and is used repeatedly. Therefore, it is necessary to modify the Vigenere Cipher. The purpose of this study is to determine the modification of the Vigenere Cipher using a symmetric group and also to determine the level of security of the encryption results of Vigenere Cipher modification when compared to the Vigenere Cipher. The results obtained from this research is a new algorithm of the modification process of the Vigenere Cipher using symmetric groups. The modified Vigenere Cipher algorithm is proven to be stronger than the Vigenere Cipher. This is because the plaintext is scrambled first using a symmetric group encoding, so that the actual plaintext is safe against attacks by the Kasiski method and exhaustive key search. In addition, the resulting new algorithm also supports the use of capital letters, lowercase letters, numbers, and symbols.

Membangun Super Enkripsi untuk Mengamankan Pesan Laura Agustina; Imam Sujarwo; Muhammad Khudzaifah
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

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.

Title

Found 9 Documents
Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title Search

Found 9 Documents Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 9 Documents
Search