Claim Missing Document
Check
Articles

Found 4 Documents
Search

PENERAPAN APLIKASI ONLINE DALAM MENINGKATKAN PEMASARAN PRODUK PABRIK TAHU PADA USAHA MAJU Siahaan, R. Fanry; Sipayung, Liskedame Yanti; Lubis, Rodiah Hanum; Amalia, Dwi Novia
Community Development Journal : Jurnal Pengabdian Masyarakat Vol. 6 No. 3 (2025): Volume 6 No 3 Tahun 2025
Publisher : Universitas Pahlawan Tuanku Tambusai

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31004/cdj.v6i3.48731

Abstract

Setiap usaha mikro, kecil dan menengah mmerlukan sistem informasi untuk memudahkan menyampaikan dan bertukar informasi dan juga untuk memperluas pemasaran. website atau toko online dapat menjadi sarana yang efektif untuk meningkatkan pemasaran produk pabrik tahu. Situs web atau toko online harus dirancang dengan baik dan informatif, menampilkan informasi yang jelas tentang produk pabrik tahu, harga, ukuran, varian serta informasi lain yang relevan. Tujuan utama penerapan aplikasi online ini selain dari memberikan informasi kepada masyarat juga sebagai media untuk menjagkau pasar baru dalam pemasaran produk dari olahan pabrik tahu Usaha Maju. Dengan demikian diharapkan mampu meningkatkan penjualan serta profit yang meningkat bagi pelaku usaha. Metode yang digunakan dalam perancangan website adalah metode waterfall.
Analysis of Data Security Improvement with the 12x8 Matrix Cipher Playfair Algorithm sipayung, Liskedame Yanti; Siahaan, R. Fanry; Lubis, Rodiah Hanum; Amalia, Dwi Novia
Bahasa Indonesia Vol 17 No 06 (2025): Instal : Jurnal Komputer
Publisher : Cattleya Darmaya Fortuna

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.54209/jurnalinstall.v17i06.407

Abstract

This research proposes a modification of the Playfair Cipher algorithm with a 12×8 matrix to improve data security. This method expands the key space to 96 by adding characters (letters, numbers, symbols), thereby increasing resistance to brute-force attacks and frequency analysis. Test results show that the resulting ciphertext has high entropy with an even character distribution, and an average encryption time of 0.15 seconds per 1,000 characters. Security analysis proves that the 12×8 matrix requires >10¹⁰⁰ years to be computationally cracked, significantly more secure than the 5×5 matrix. Despite the higher resource requirements, this algorithm remains efficient for applications such as sensitive data storage and encrypted communications. In conclusion, this modification offers significant security improvements without drastically sacrificing performance.  
Application of Dijkstra's Algorithm to Determine the Shortest Route from City Center to Medan City Tourist Attractions Sipayung, Liskedame Yanti; Sinaga, Chaston Ramotto; Sagala, Angelica Claudia
Journal of Computer Networks, Architecture and High Performance Computing Vol. 5 No. 2 (2023): Article Research Volume 5 Issue 2, July 2023
Publisher : Information Technology and Science (ITScience)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47709/cnahpc.v5i2.2699

Abstract

Tourist attractions are very interesting things to visit in an area that we are living. It is no exception when visiting the city of Medan, the tourists will visit interesting tourist spots in the city of Medan. To optimize time so that you can visit all tourist attractions in Medan City, you need to map locations so that you can create the shortest route that can be used to take all the tourist sites you want to visit in Medan City. The shortest route of a trip will shorten the travel time. Likewise in terms of seeking experts. When requesting a route from one point (start point) to another location (destination point), usually the result that comes out is the "shortest path" from the starting point to the destination point. The shortest path is the problem of finding a path between two or more vertices in a minimum weighted graph. To simplify solving the shortest path problem, a search algorithm is needed. Dijkstra's algorithm solves the problem of finding the shortest path between two vertices in a weighted graph with the smallest total number, by finding the shortest distance between the initial vertex and other vertices, so that the path formed from the initial vertex to the destination vertex has the smallest total weight. In this study, Dijkstra's algorithm looks for the shortest path based on the smallest weight from one point to another, so that it can help provide a choice of paths. Based on the trials of Dijkstra's algorithm, it has the ability to find the shortest path, because in this algorithm each graph is selected an edge with a minimum weight that connects the selected vertices with other unselected vertices.
Data Security Analysis with Triple DES Cryptographic Algorithm Sipayung, Liskedame Yanti; Purba, Megaria
Journal of Intelligent Decision Support System (IDSS) Vol 6 No 4 (2023): December: Intelligent Decision Support System (IDSS)
Publisher : Institute of Computer Science (IOCS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35335/idss.v6i4.198

Abstract

The Data Encryption Standard (DES) is the first and most significant modern symmetry encryption algorithm. DES was released by the United States' National Bureau of Standards in January 1977 as an algorithm used for unclassified data (information that has nothing to do with national security). Although DES has been widely used in many applications around the world, there are still many controversial issues regarding the security of this algorithm. Therefore, this paper aims to discuss the security analysis of the DES cryptographic algorithm and also the security analysis of the DES algorithm variations, namely Double DES and Triple DES. Because the level of secrecy of the 3DES algorithm lies in the length of the key used, the use of the 3DES algorithm is considered more secure than the DES algorithm. To facilitate the use of the 3DES algorithm, a 3DES algorithm program was created with computer software tools, namely Matlab 7.0.4 which can encrypt and decrypt files with the .txt extension.