Fuzzy TOPSIS as a decision support system is a mathematical method with the best alternative concept chosen not only to have the shortest distance to the positive ideal solution, but also to have the longest distance to the negative ideal solution. The use of Fuzzy TOPSIS as a decision support system can minimize the weaknesses that exist in the TOPSIS method. The purpose of this study is to apply the Fuzzy TOPSIS method as a Decision Support System (SPK) to determine outstanding employees at the Batu City Population and Civil Registration Office. The Human Resources (HR) Division has the task of validating the value and processing the value of employee work goals and work behavior using the Fuzzy TOPSIS implementing into recommendations for outstanding employees. Data processing is carried out fuzzy, while calculations are carried out by the TOPSIS method. The output of this calculation is in the form of ranking the value of preferences and recommendations available for all employees. The calculation results obtained the highest preference value, namely by the first alternative with a value of 1. The alternative occupied a position as an outstanding employee at the Batu City Population and Civil Registration Office.
{"title":"Metode Fuzzy TOPSIS Sebagai Sistem Pendukung Keputusan dalam Menentukan Pegawai Berprestasi","authors":"Fairuz Nadhif Izdhihar, Evawati Alisah, Abdussakir Abdussakir","doi":"10.18860/jrmm.v2i6.22024","DOIUrl":"https://doi.org/10.18860/jrmm.v2i6.22024","url":null,"abstract":"Fuzzy TOPSIS as a decision support system is a mathematical method with the best alternative concept chosen not only to have the shortest distance to the positive ideal solution, but also to have the longest distance to the negative ideal solution. The use of Fuzzy TOPSIS as a decision support system can minimize the weaknesses that exist in the TOPSIS method. The purpose of this study is to apply the Fuzzy TOPSIS method as a Decision Support System (SPK) to determine outstanding employees at the Batu City Population and Civil Registration Office. The Human Resources (HR) Division has the task of validating the value and processing the value of employee work goals and work behavior using the Fuzzy TOPSIS implementing into recommendations for outstanding employees. Data processing is carried out fuzzy, while calculations are carried out by the TOPSIS method. The output of this calculation is in the form of ranking the value of preferences and recommendations available for all employees. The calculation results obtained the highest preference value, namely by the first alternative with a value of 1. The alternative occupied a position as an outstanding employee at the Batu City Population and Civil Registration Office.","PeriodicalId":270235,"journal":{"name":"Jurnal Riset Mahasiswa Matematika","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116974090","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-06-30DOI: 10.18860/jrmm.v2i5.22004
Tre Hayu Ria Reta, Evawati Alisah, M. N. Jauhari
The Fuzzy Simple Additive Weighting (FSAW) method is a mechanism that can be used to support decision making. This method was chosen because a ranking process was carried out to determine the weight value of each attribute, which would select employees who were worthy of occupying the promoted position. This study aims to determine the results of the application of the FSAW method in the assessment of civil servant promotion at the Malang City Education and Culture Office to increase objectivity and fairness in the assessment of employee promotion. Some problems that often occur in employee evaluation are the employee evaluation process which is still conventional so that it is less effective in calculation. The solution to overcome this problem is to use a Fuzzy Multi Attribute Decision Making (FMADM) decision support system with the FSAW method. This method requires a process to normalize the decision matrix (X) against a scale that can be compared with all available alternative values. After each attribute has been determined its weight value, the ranking process is used to select the best alternative for this study. The criteria used in this decision support system are SKP score, length of service, class, and education. The membership function used is the Triangular Fuzzy Number (TFN) representation. The results of the ranking calculation or the best value show the highest value, namely 1 from alternative 1 (employee 1) who is entitled to a promotion. It is expected that by using the FSAW method, the task of selectors will be able to more quickly and precisely identify employees who are worthy of occupying positions promoted based on the desired conditions.
{"title":"Penerapan Metode Fuzzy Simple Additive Weigting Pada Interpretasi Hasil Penilaian Promosi Jabatan Pegawai Negeri Sipil","authors":"Tre Hayu Ria Reta, Evawati Alisah, M. N. Jauhari","doi":"10.18860/jrmm.v2i5.22004","DOIUrl":"https://doi.org/10.18860/jrmm.v2i5.22004","url":null,"abstract":"The Fuzzy Simple Additive Weighting (FSAW) method is a mechanism that can be used to support decision making. This method was chosen because a ranking process was carried out to determine the weight value of each attribute, which would select employees who were worthy of occupying the promoted position. This study aims to determine the results of the application of the FSAW method in the assessment of civil servant promotion at the Malang City Education and Culture Office to increase objectivity and fairness in the assessment of employee promotion. Some problems that often occur in employee evaluation are the employee evaluation process which is still conventional so that it is less effective in calculation. The solution to overcome this problem is to use a Fuzzy Multi Attribute Decision Making (FMADM) decision support system with the FSAW method. This method requires a process to normalize the decision matrix (X) against a scale that can be compared with all available alternative values. After each attribute has been determined its weight value, the ranking process is used to select the best alternative for this study. The criteria used in this decision support system are SKP score, length of service, class, and education. The membership function used is the Triangular Fuzzy Number (TFN) representation. The results of the ranking calculation or the best value show the highest value, namely 1 from alternative 1 (employee 1) who is entitled to a promotion. It is expected that by using the FSAW method, the task of selectors will be able to more quickly and precisely identify employees who are worthy of occupying positions promoted based on the desired conditions.","PeriodicalId":270235,"journal":{"name":"Jurnal Riset Mahasiswa Matematika","volume":"60 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115131314","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-06-30DOI: 10.18860/jrmm.v2i5.16791
Niken Dwi Cahyanti, Turmudi Turmudi, Muhammad Khudzaifah
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.
{"title":"Modifikasi Vigenere Cipher Menggunakan Grup Simetri untuk Mengamankan Pesan Teks","authors":"Niken Dwi Cahyanti, Turmudi Turmudi, Muhammad Khudzaifah","doi":"10.18860/jrmm.v2i5.16791","DOIUrl":"https://doi.org/10.18860/jrmm.v2i5.16791","url":null,"abstract":"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.","PeriodicalId":270235,"journal":{"name":"Jurnal Riset Mahasiswa Matematika","volume":"82 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120818290","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-06-30DOI: 10.18860/jrmm.v2i5.21036
Laura Agustina, Imam Sujarwo, Muhammad Khudzaifah
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":"Membangun Super Enkripsi untuk Mengamankan Pesan","authors":"Laura Agustina, Imam Sujarwo, Muhammad Khudzaifah","doi":"10.18860/jrmm.v2i5.21036","DOIUrl":"https://doi.org/10.18860/jrmm.v2i5.21036","url":null,"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.","PeriodicalId":270235,"journal":{"name":"Jurnal Riset Mahasiswa Matematika","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136065457","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A graph is a non-empty set whose members are vertices and edges, where the edges connect several pairs of these vertices; likewise, social media connects users with each other through interests, relationships, likes and dislikes. The rapid development of technology in the era of globalization has made social media a more effective source of information, one of them is Twitter which has been used by 280 million people in the world. This research involves 100 Twitter users who are classified as Influencers in Indonesia who have more than 10,000 followers by visualizing their relationship with other users followed by them with a directed and weighted graph. First, the data is filtered using the Twecoll script in Python software, then the data is visualized using the Gephi software in the form of a directed and weighted graph. The centrality value is calculated to determine the influential influencers in spreading information on the network. Based on the results of the study, it was found that the network pattern of 100 Influencers that had been collected in the following list of @dearmyths accounts, there were 96 points and 1883 sides with the side having the highest weight being @detikcom, followed by @ivanlanin and @ernestprakasa through the results of centrality calculations as accounts that can disseminate information on the network.
{"title":"Penerapan Graf Berarah dan Berbobot untuk Mengetahui Inluencer yang Paling Berpengaruh dalam Penyebaran Informasi pada Twitter","authors":"Aisyah Rafi' Addani, Turmudi Turmudi, Imam Sujarwo","doi":"10.18860/jrmm.v2i5.16810","DOIUrl":"https://doi.org/10.18860/jrmm.v2i5.16810","url":null,"abstract":"A graph is a non-empty set whose members are vertices and edges, where the edges connect several pairs of these vertices; likewise, social media connects users with each other through interests, relationships, likes and dislikes. The rapid development of technology in the era of globalization has made social media a more effective source of information, one of them is Twitter which has been used by 280 million people in the world. This research involves 100 Twitter users who are classified as Influencers in Indonesia who have more than 10,000 followers by visualizing their relationship with other users followed by them with a directed and weighted graph. First, the data is filtered using the Twecoll script in Python software, then the data is visualized using the Gephi software in the form of a directed and weighted graph. The centrality value is calculated to determine the influential influencers in spreading information on the network. Based on the results of the study, it was found that the network pattern of 100 Influencers that had been collected in the following list of @dearmyths accounts, there were 96 points and 1883 sides with the side having the highest weight being @detikcom, followed by @ivanlanin and @ernestprakasa through the results of centrality calculations as accounts that can disseminate information on the network.","PeriodicalId":270235,"journal":{"name":"Jurnal Riset Mahasiswa Matematika","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116712531","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-06-30DOI: 10.18860/jrmm.v2i5.22006
Fitri Nofita Sari, Juhari Juhari, Erna Herawati
The Floyd-Warshall algorithm is one of the algorithms that can be used to solve the shoetest route problem and is the easiests to apply because it can find all the shortest routes between each possible pair of position and is part of a dynamic program that is very efficient in solving optimal route promblems. The Floyd-Warshall algorithm works by comparing each possible path on the graph for each node pair and checking the resulting node combination. The problem of the shortest route in daily life is the evacuation of victims of traffic accidents in Boyolali, Central Java. For evacuation to be more effective, a nearby route to the nearest hospital is needed. Based on the results of the research that has been done, it can be concluded that the study produced reference matrix in the form of the shortest trajectory used to determine the shortest route to nearest hospital in Boyolali, Central Java.
{"title":"Penerapan Algoritma Floyd-Warshall pada Jalur Evakuasi Korban Kecelakaan di Boyolali","authors":"Fitri Nofita Sari, Juhari Juhari, Erna Herawati","doi":"10.18860/jrmm.v2i5.22006","DOIUrl":"https://doi.org/10.18860/jrmm.v2i5.22006","url":null,"abstract":"The Floyd-Warshall algorithm is one of the algorithms that can be used to solve the shoetest route problem and is the easiests to apply because it can find all the shortest routes between each possible pair of position and is part of a dynamic program that is very efficient in solving optimal route promblems. The Floyd-Warshall algorithm works by comparing each possible path on the graph for each node pair and checking the resulting node combination. The problem of the shortest route in daily life is the evacuation of victims of traffic accidents in Boyolali, Central Java. For evacuation to be more effective, a nearby route to the nearest hospital is needed. Based on the results of the research that has been done, it can be concluded that the study produced reference matrix in the form of the shortest trajectory used to determine the shortest route to nearest hospital in Boyolali, Central Java.","PeriodicalId":270235,"journal":{"name":"Jurnal Riset Mahasiswa Matematika","volume":"260 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131572014","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-05-01DOI: 10.18860/jrmm.v2i4.14902
Luluk Afifah, Imam Sujarwo, Muhammad Khudzaifah
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.
{"title":"Indeks Harmonik dan Indeks Gutman Graf Nilradikal pada Gelanggang Komutatif dengan Satuan","authors":"Luluk Afifah, Imam Sujarwo, Muhammad Khudzaifah","doi":"10.18860/jrmm.v2i4.14902","DOIUrl":"https://doi.org/10.18860/jrmm.v2i4.14902","url":null,"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.","PeriodicalId":270235,"journal":{"name":"Jurnal Riset Mahasiswa Matematika","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122353323","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-05-01DOI: 10.18860/jrmm.v2i4.16811
Bella Nafa Savitri, M. N. Jauhari, Evawati Alisah, Hisyam Fahmi
PT Citra Akes Indonusa is a company that operates on the expertise of information technology services in Banten Province. One of the services provided by the company requires the construction of a Base Transceiver Station (BTS) tower. The tower requires maintenance if there is damage to the network signal. As a result, the shortest route is needed to make it easier for employees to reach the tower location to be more effective. There are eight BTS tower locations in Tangerang Regency and three BTS tower locations in Tangerang City. The process of finding the shortest route in this study uses the Floyd Warshall algorithm, which is unique in finding the shortest route by comparing each edge of all edges that are passed. The process of testing the shortest route is done by selecting the starting point, then selecting several BTS tower locations. Next, the shortest route will be searched using the Floyd Warshall algorithm from each point of destination for the BTS tower location, then the BTS tower location will be selected first and so on until the last destination. The effectiveness of this shortest route search involves a comparison of the routes presented by Google Maps. Based on the results of 30 randomized trials on BTS tower locations, the average shortest route effectiveness was 25.54% compared to the route generated by Google Maps. This is due to the selection at each BTS tower destination location so as to make the route more effective.
{"title":"Implementasi Algoritma Floyd Warshall dalam Pencarian Rute Terpendek Lokasi Tower Base Transceiver Station (BTS) pada PT Citra Akses Indonusa","authors":"Bella Nafa Savitri, M. N. Jauhari, Evawati Alisah, Hisyam Fahmi","doi":"10.18860/jrmm.v2i4.16811","DOIUrl":"https://doi.org/10.18860/jrmm.v2i4.16811","url":null,"abstract":"PT Citra Akes Indonusa is a company that operates on the expertise of information technology services in Banten Province. One of the services provided by the company requires the construction of a Base Transceiver Station (BTS) tower. The tower requires maintenance if there is damage to the network signal. As a result, the shortest route is needed to make it easier for employees to reach the tower location to be more effective. There are eight BTS tower locations in Tangerang Regency and three BTS tower locations in Tangerang City. The process of finding the shortest route in this study uses the Floyd Warshall algorithm, which is unique in finding the shortest route by comparing each edge of all edges that are passed. The process of testing the shortest route is done by selecting the starting point, then selecting several BTS tower locations. Next, the shortest route will be searched using the Floyd Warshall algorithm from each point of destination for the BTS tower location, then the BTS tower location will be selected first and so on until the last destination. The effectiveness of this shortest route search involves a comparison of the routes presented by Google Maps. Based on the results of 30 randomized trials on BTS tower locations, the average shortest route effectiveness was 25.54% compared to the route generated by Google Maps. This is due to the selection at each BTS tower destination location so as to make the route more effective.","PeriodicalId":270235,"journal":{"name":"Jurnal Riset Mahasiswa Matematika","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125557972","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-05-01DOI: 10.18860/jrmm.v2i4.14470
Laura Agustina, Imam Sujarwo, Muhammad Khudzaifah
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.
{"title":"Membangun Super Enkripsi untuk Mengamankan Pesan","authors":"Laura Agustina, Imam Sujarwo, Muhammad Khudzaifah","doi":"10.18860/jrmm.v2i4.14470","DOIUrl":"https://doi.org/10.18860/jrmm.v2i4.14470","url":null,"abstract":"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.","PeriodicalId":270235,"journal":{"name":"Jurnal Riset Mahasiswa Matematika","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136273479","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-05-01DOI: 10.18860/jrmm.v2i4.16805
Siti Maftuhah, Heni Widayani, A. Kusumastuti
This research is focused on solving the rate law equation by using the differential transformation method. The rate law equation describes the chemical reaction problem from the concentration of a reactant that produces a product. The differential transformation method is a semi-analytic numerical method that can provide approximate solutions in the form of a series because the method is obtained from the expansion of the Taylor series expansion. With the help of Maple software, a comparison of the solution plots of y_1 (t),y_2 (t) and y_3 (t), can be observed that the difference in computational results between the Runge-kutta method and the differential transformation depends on the order of k. The curve of the differential transformation method is getting closer to the curve of the Runge-Kutta method at a certain value of k for each y_1 (t),y_2 (t) and y_3 (t). The conclusion of this research is that the application of the differential transformation method has been successfully carried out in the case of a system of ordinary differential equations. For further research, the researcher suggests that the next research applies the method of differential transformation in cases and initial values that are more varied.
{"title":"Penyelesaian Sistem Persamaan Hukum Laju Reaksi dengan Metode Transformasi Differensial","authors":"Siti Maftuhah, Heni Widayani, A. Kusumastuti","doi":"10.18860/jrmm.v2i4.16805","DOIUrl":"https://doi.org/10.18860/jrmm.v2i4.16805","url":null,"abstract":"This research is focused on solving the rate law equation by using the differential transformation method. The rate law equation describes the chemical reaction problem from the concentration of a reactant that produces a product. The differential transformation method is a semi-analytic numerical method that can provide approximate solutions in the form of a series because the method is obtained from the expansion of the Taylor series expansion. With the help of Maple software, a comparison of the solution plots of y_1 (t),y_2 (t) and y_3 (t), can be observed that the difference in computational results between the Runge-kutta method and the differential transformation depends on the order of k. The curve of the differential transformation method is getting closer to the curve of the Runge-Kutta method at a certain value of k for each y_1 (t),y_2 (t) and y_3 (t). The conclusion of this research is that the application of the differential transformation method has been successfully carried out in the case of a system of ordinary differential equations. For further research, the researcher suggests that the next research applies the method of differential transformation in cases and initial values that are more varied.","PeriodicalId":270235,"journal":{"name":"Jurnal Riset Mahasiswa Matematika","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114616190","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：