Article Per Year (5 Year)
p-Index From 2020 - 2025
2.083
P-Index
This Author published in this journals
All Journal Jatilima : Jurnal Multimedia Dan Teknologi Informasi INFOKUM Jurnal Pengabdian kepada Masyarakat Nusantara Jurnal Minfo Polgan (JMP) Jurnal Pengabdian Masyarakat Nusantara
Subhan Hafiz Nanda Ginting
Universitas Battuta
Computer Science & IT Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Health Professions Library & Information Science Mathematics Social Sciences Other

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

Found 2 Documents
Search
Journal : Jurnal Minfo Polgan (JMP)

 1 
Playfair Cipher Algorithm in Learning Media Subhan Hafiz Nanda Ginting; Muhammad Rhifky Wayahdi; Surya Guntur
Jurnal Minfo Polgan Vol. 11 No. 1 (2022): Article Research
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/jmp.v11i1.11560

Abstract

The level of security and confidentiality of information / data becomes very important in the era of increasingly sophisticated and developing technology. Cryptographic methods can be one solution to overcome problems in the level of security and confidentiality of information. However, knowledge about cryptography is still a lot of audiences who do not know and understand its use in securing the secrets of information, for that we need an application which presents a learning media that is expected to help provide knowledge from cryptography. This study implements a learning media application that discusses a Playfair Cipher classic cryptographic method, a cryptographic technique that encrypts bigrams using a matrix table consisting of 25 letters in it, text that can be encrypted in the form of alphabet letters on the system that has been tested. The results of the encryption and decryption of the text do not have spaces or symbols in it, the application of playfair cipher cryptographic learning media is aimed at computer students as a tool to better understand the playfair cipher cryptographic material.
The Utilization Of The Simple Multi Attribute Rating Exploiting Ranks Can Enhance The Performance Of The Aco Algorithm Subhan Hafiz Nanda Ginting; Mayang Mughnyanti
Jurnal Minfo Polgan Vol. 12 No. 1 (2023): Artikel Penelitian 2023
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/jmp.v12i1.12743

Abstract

In a comparative study, the performance of the ACO algorithm and a modified genetic algorithm (MGA) were evaluated for solving the multiple salesman traveling problem (MTSP) using various datasets from TSPLIB. The results revealed that although the proposed algorithm did not achieve the best solution, it exhibited improved time efficiency as the dataset size increased. The objective of this study is to improve the performance of the ACO algorithm by integrating the SMARTER algorithm, which aims to find the optimal route and minimize travel time. The combination of these algorithms offers alternative path solutions that can be effectively applied to solve TSP case examples and advance the development of new algorithms that excel in identifying the closest path. The study utilized TSPLIB datasets ranging in size from 76 to 1002 cities, sourced from the Felts and Nelson Krolak repositories. Within this study, the ACO algorithm was employed to optimize the overall distance in the TSP dataset, while the SMARTER algorithm generated suggestions for the optimal routes based on the total trip distance calculated by ACO. Experimental results demonstrated that the ACO algorithm, combined with SMARTER, achieved an average time improvement of 74.09% compared to the MGA algorithm, representing the most optimal performance.
Co-Authors Dewi Wahyuni Dinur Syahputra Dinur Syahputra M. Rhifky Wayahdi Mayang Mughnyanti Rutmian Mariama Rutmian Mariama Hutasoit ruziq, fahmi Sheila Try Thania Surya Guntur