Zulkarnaen Zulkarnaen
STMIK Syaikh Zainuddin NW Anjani

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

Found 3 Documents
Search

Implementasi Kombinasi Caesar Cipher dan Hill Cipher Menggunakan Modifikasi Sandi Morse Untuk Pengamanan Pesan Berbasis Teks Muhammad Azmi; Zulkarnaen Zulkarnaen
JTIM : Jurnal Teknologi Informasi dan Multimedia Vol 3 No 1 (2021): May
Publisher : Puslitbang Sekawan Institute Nusa Tenggara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35746/jtim.v3i1.124

Abstract

The security and confidentiality of a message or document sent to other people must be guaranteed its confidentiality and security, so that the message or document is not misused by parties who do not have an interest in the message. Security and confidentiality of messages or documents can be kept confidential and secure by using cryptography. data security and confidentiality issues are very important from an information. Because of the importance of this information, the person concerned will question whether the authenticity of the information is still maintained or whether the information has been hijacked. So in the process of securing data and information with cryptography, of course it requires a qualified algorithm to maintain the confidentiality of the information, so that the purpose of this research is how to maintain the confidentiality of information by converting information into codes known only to the sender and receiver by using cryptographic techniques and steganography. Then the process of securing the data or information the researcher uses a combination of Caesar Chiper and Hill Chiper which is modified into Morse code then the resulting CipherText results will be saved into a JPEG file using the LSB (Least Significant Bit) Steganography method. The process of storing messages or ciphertext into image files will make it difficult for irresponsible people or cryptoanalysts to solve messages sent in the form of images.
IMPLEMENTASI ALGORITMA I-SOS DALAM PENYELESAIAN TRAVELING SALESMAN PROBLEM (TSP) Zulkarnaen Zulkarnaen; Muhammad Azmi
TEKNIMEDIA: Teknologi Informasi dan Multimedia Vol. 2 No. 1 (2021): Mei 2021
Publisher : Badan Penelitian dan Pengabdian Masyarakat (BP2M) STMIK Syaikh Zainuddin NW Anjani

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1403.431 KB) | DOI: 10.46764/teknimedia.v2i1.29

Abstract

The problem with TSP is an attempt to find the shortest distance traveled by a salesman in visiting each city without having to visit the same city more than once. The purpose of implementing the I-SOS algorithm in this case is to find the minimum distance traveled, a solution can be obtained after going through the calculation of the mutualism phase, commensalism phase, parasitism phase and predation phase. The resolution of TSP problems in the study begins with the process of identifying each city by providing a random value to represent each destination city. The random value used is between 0 and 1, the random results obtained will then be sorted with the provision that the smallest random value will be used as the initial for city A while the largest random value is used as the initial for city D. In the first random, the random value | 0.5 | 0.27 | 0.75 | 0.25 | the city representation of the random number is | C | B | D | A | or if the values are sorted, the city order will be obtained, namely A = 0.25, B = 0.27, C = 0.5 and D = 0.75, this process will continue until all the organisms defined in the ecosystem are formed
SISTEM INFORMASI ANTREAN BERBASIS WEB DAN LED MATRIX DISPLAY Zulkarnaen Zulkarnaen; Nizar Mukhsin
TEKNIMEDIA: Teknologi Informasi dan Multimedia Vol. 4 No. 2 (2023): Desember 2023
Publisher : Badan Penelitian dan Pengabdian Masyarakat (BP2M) STMIK Syaikh Zainuddin NW Anjani

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.46764/teknimedia.v4i2.165

Abstract

Queues are often encountered in daily activities. The queuing process is a process related to the arrival of customers at a service facility, waiting to get service until they finally get service and leave the service facility. Many queue models use single-server, single-phase system and multiple-server, single-phase system. Currently, there are still service facilities that have not utilized technology to provide convenience for the users. One way to improve service quality is by using a queuing system. The method applied in building this system is Prototype method. The prototype method consists of communication, which is the stage of data collection through the method of literature, observation, experiments which are described in use cases, activity and sequence diagrams as well as device requirements. Modeling Quick Design is the stage of making a brief description of the design in the form of architecture and appearance design. Construction of Prototype is the design stage, built using PHP MVC, MySQL, C++, JavaScript, JSON, NodeMCU ESP8266 microcontroller as a link for each device via a Wi-Fi network as well as a P10 led matrix display controller. P10 led matrix and monitor displays the queue number. The web server installed on the PC acts as a center for managing queue numbers, queue voice calls via text to speech as a voice generator in the Edge browser. Deployment Delivery & Feedback are the testing stages. the results obtained are to produce a web-based queue number information system and led matrix display that has been tested using black box testing that this system can run well