cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Mesran
Contact Email
mesran.skom.mkom@gmail.com
Phone
+6282161108110
Journal Mail Official
jurnal.json@gmail.com
Editorial Address
STMIK Budi Darma Jln. Sisingamangaraja No. 338 Telp 061-7875998
Location
Kota medan,
Sumatera utara
INDONESIA
Jurnal Sistem Komputer dan Informatika (JSON)
Published by Sekolah Tinggi Manajemen Informatika dan Komputer Budi Darma
ISSN : -     EISSN : 2685998X     DOI : https://dx.doi.org/10.30865/json.v1i3.2092
Core Subject : Science, Engineering,
Computer Science & IT Control & Systems Engineering
The Jurnal Sistem Komputer dan Informatika (JSON) is a journal to managed of STMIK Budi Darma, for aims to serve as a medium of information and exchange of scientific articles between practitioners and observers of science in computer. Focus and Scope Jurnal Sistem Komputer dan Informatika (JSON) journal: Embedded System Microcontroller Artificial Neural Networks Decision Support System Computer System Informatics Computer Science Artificial Intelligence Expert System Information System, Management Informatics Data Mining Cryptography Model and Simulation Computer Network Computation Image Processing etc (related to informatics and computer science)
Arjuna Subject : Ilmu Komputer (semua kategori) - Ilmu Komputer (Lain-Lain)
Articles 757 Documents
 48   49   50   51   52 
Optimasi Pengamanan Pesan Suara Menggunakan Vernam Cipher Berbasis Algoritma Blum Blum Shub Simanjuntak, Agnes Victoria; Eliasta Ketaren; Marline S. Paendong
Jurnal Sistem Komputer dan Informatika (JSON) Vol. 7 No. 3 (2026): Maret 2026
Publisher : Universitas Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/json.v7i3.9666

Abstract

Perkembangan teknologi informasi yang pesat meningkatkan kemudahan dalam pertukaran data digital, termasuk pesan suara, namun juga menimbulkan risiko keamanan seperti penyadapan dan penyalahgunaan informasi. Oleh karena itu, diperlukan metode pengamanan yang kuat dan andal. Penelitian ini bertujuan untuk mengoptimalkan pengamanan pesan suara dengan mengombinasikan algoritma Blum Blum Shub (BBS) sebagai pembangkit bilangan acak kriptografis dengan Vernam Cipher. Proses dimulai dengan perekaman suara yang dikonversi ke dalam bentuk digital, kemudian direpresentasikan dalam bentuk biner. Selanjutnya, data dienkripsi menggunakan operasi XOR dengan keystream yang dihasilkan oleh algoritma BBS. Tahap dekripsi dilakukan dengan menggunakan kunci yang sama untuk mengembalikan data ke bentuk semula. Selain itu, proses pengolahan data melibatkan transformasi sinyal menggunakan Mel-Spectrogram sebelum dikonversi ke dalam bentuk biner. Hasil pengujian menunjukkan bahwa sistem mampu menghasilkan ciphertext yang tidak dapat dikenali serta memiliki tingkat keacakan yang tinggi. Perbedaan nilai seed menghasilkan ciphertext yang berbeda meskipun menggunakan data suara yang sama, menunjukkan tingkat keamanan yang baik. Proses dekripsi berhasil mengembalikan pesan suara ke bentuk semula tanpa kehilangan informasi. Dengan demikian, kombinasi algoritma Blum Blum Shub dan Vernam Cipher terbukti efektif dalam meningkatkan keamanan pengamanan pesan suara.
Analisis Perbandingan BLAKE2S dan SHA3-512 dalam Pengujian Ketahanan terhadap Serangan Bruteforce Mokolanot, Rizky Akbar; Eliasta Ketaren; Mans Lumiu Mananohas
Jurnal Sistem Komputer dan Informatika (JSON) Vol. 7 No. 3 (2026): Maret 2026
Publisher : Universitas Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/json.v7i3.9667

Abstract

Perkembangan teknologi komputasi modern, seperti high-performance computing, cloud computing, dan GPU, telah meningkatkan kemampuan penyerang dalam melakukan serangan brute force terhadap sistem kriptografi. Penelitian ini bertujuan untuk menganalisis dan membandingkan ketahanan dua algoritma hash modern, yaitu BLAKE2s dan SHA3-512, terhadap serangan brute force dalam konteks pengamanan data berbasis steganografi video. Metode penelitian dilakukan melalui pengujian empiris dengan mengukur waktu cracking, hash rate, serta jumlah percobaan yang dibutuhkan untuk menemukan nilai hash. Hasil penelitian menunjukkan bahwa SHA3-512 memiliki ketahanan yang lebih tinggi dibandingkan BLAKE2s, dengan waktu cracking sebesar 511.479 detik, sementara BLAKE2s hanya membutuhkan 216.156 detik. Perbedaan ini dipengaruhi oleh hash rate BLAKE2s yang lebih tinggi, yaitu 1.350.846 H/s, dibandingkan SHA3-512 sebesar 570.881 H/s, sehingga mempercepat proses brute force. Meskipun demikian, waktu embedding kedua algoritma relatif sama, dengan selisih yang tidak signifikan. Jumlah percobaan brute force pada kedua algoritma juga identik, yaitu 291.993.781 percobaan, yang menunjukkan bahwa perbedaan ketahanan lebih dipengaruhi oleh efisiensi komputasi daripada kompleksitas ruang pencarian. Dengan demikian, SHA3-512 direkomendasikan sebagai algoritma hash yang lebih aman untuk melindungi data rahasia terhadap serangan brute force, meskipun memiliki performa yang lebih rendah dibandingkan BLAKE2s
Perancangan Aplikasi Ensiklopedia Ilmuwan Islam Berbasis Android dengan Metode Crochemore Perrin Fitria Fitria
Jurnal Sistem Komputer dan Informatika (JSON) Vol. 1 No. 1 (2019): September 2019
Publisher : Universitas Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/json.v1i1.1364

Abstract

Encyclopedia in the form of a number of writings that contain explanations that store information comprehensively and quickly understood and understood. Scientists generally mean intelligence and knowledge in a field arranged systematically according to the rules and methods that can be used to explain and explain and understand things related to the field of scientists. One solution to solve the problem of searching for Android-based Islamic scientists with the Crochemore Perrin method. To simplify the process of searching strings on Android-based Islamic scientist encyclopedias. By applying the Perrin Crochemore algorithm to the Android-based Islamic scientist search system, the process of searching for Islamic scientists is easier and faster. The system is designed very practical because it uses an Android application. So it can be accessed anywhere.
Implementasi Algoritma Zhu-Takaoka pada Aplikasi Pencarian Makanan Khas di Dunia Berbasis Android Ardiansyah Reza Saragih
Jurnal Sistem Komputer dan Informatika (JSON) Vol. 1 No. 1 (2019): September 2019
Publisher : Universitas Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/json.v1i1.1365

Abstract

One thing that should not be missed by a traveler is tasting the typical food of the country that is being visited. However, they still don't know what special foods are in the country. You can use the Google Search service to find information on these special foods, but you need an internet connection. The problem is, maybe the country that is being visited is difficult to get an internet connection, or the traveler runs out and forgets to fill out his smartphone's internet quota, or maybe his smartphone cellular operator can't be used abroad. If you buy a new sim card that is suitable for the country you visit, of course it is troublesome. Because every time you change countries you have to buy a new sim card that suits the country you are visiting. To overcome this problem, a simple application that is operated on an Android-based smartphone that is useful helps us find special foods from various countries. This application is very simple and is offline, which means it does not require an internet connection. Users only need to enter the name of the country and what foods will appear in that country. Application designed using one of the search algorithms, namely Zhu-Takaoka. The Zhu-Takaoka algorithm is a development of the Boyer-Moore algorithm.
Sistem Informasi Geografis Pencarian Lokasi Kafe di Medan Menerapkan Algoritma Tabu Search (TS) Julianti Julianti
Jurnal Sistem Komputer dan Informatika (JSON) Vol. 1 No. 1 (2019): September 2019
Publisher : Universitas Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/json.v1i1.1366

Abstract

The cafe business in Medan is currently growing very rapidly. This can be seen by the many cafes that have sprung up, because cafes have become a lifestyle for most people today. The existence of the location of cafes in the city of Medan very much and almost every city of Medan there are more than one cafe. Because the amount that spreads makes people confused even do not know the location of the location of the cafe. Requires a system to check the intended location. Based on these problems, the writer will discuss about making a Geographic Information System for Locating Cafe Locations in the City of Medan Using the Tabu Search Algorithm. This system is made using Android-based, where in this system there is location information, consisting of an address, as well as route routes that can be used to get to the location of the cafe. In this process only the admin can process input data, edit data and delete data. While users can only look for information on the location of cafes in the city of Medan. With a simple and easy-to-understand system for the public to access information on the search for cafe locations, it can be used as an effort to introduce technology based on geographic information systems to the public.
Pencarian Rute Terpendek Menggunakan Algoritma Bellman-Ford (Studi Kasus: PT. JNE Medan) Ester Tetri H Hutasoit
Jurnal Sistem Komputer dan Informatika (JSON) Vol. 1 No. 1 (2019): September 2019
Publisher : Universitas Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/json.v1i1.1367

Abstract

Every human being wants to get to his destination on time. But often congestion causes human desires are blocked. Therefore, we need a way to overcome this problem by knowing the minimum distance to reach a place. The service sector is a field that offers services by helping consumers in various ways. The service sector is a field that will never experience bankruptcy even in difficult conditions because everyone certainly needs the help of others in completing or completing various things. Freight forwarding services are one of the services most widely used, especially in saving time and costs (cost). In the freight forwarding service, the route of shipping the goods becomes very important because without a structured route, the delivery of goods becomes not timely and can be detrimental to the company itself. The loss that will be experienced by the company is that the delivery time will be longer because the delivery distance will be further. In this study the calculation of the application using the Bellman-Ford algorithm is performed which aims to find the shortest path from the office of PT. JNE Medan to Helvetia. The algorithm used is Bellman-Ford. The Belmman-Ford algorithm is used to calculate all paths from origin to destination formed in a graph to find the shortest path.
Analisa Pencarian Data *.Doc pada Komputer Menerapkan Metode Sequensial With Sentinel Frengki Santoso
Jurnal Sistem Komputer dan Informatika (JSON) Vol. 1 No. 1 (2019): September 2019
Publisher : Universitas Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/json.v1i1.1368

Abstract

In the development of computers often encounter problems about how to get a data in a large data set and various types of data. In its need to find that data, there are various search algorithms, namely the sequential with Sentinel method. Searching is data search by searching where the data is searched. The place for searching the data can be an array in memory, it can also be in a file in external storage. When the amount of data is already so large, a method is needed to get the data needed. Several methods of organizing data have made the process of finding data more efficient. In the problem that often occurs a lot of lost doc data dimension or forget the name of the stored data and therefore applied how to find doc document data that is on the computer. A data contained in the storage media with this search method is created using a search algorithm that uses successive method so that the data sought knows its whereabouts. in overcoming the problem is applied The method of doc data extension can be done in two ways, namely internal search (internal searching) and external search (external searching). In an internal search, all records that are known to be in a computer reminder are on an external search, not all records that are known to be in a computer reminder.
Sistem Pendukung Keputusan Menentukan Aparatur Sipil Negara Terbaik Pada Dinas Pengelolaan Sumber Daya Air Unit Pelaksana Teknis Dinas dengan Metode Simple Additive Weighting Sumarno Sumarno; Indra Gunawan; Heru Satria Tambunan
Jurnal Sistem Komputer dan Informatika (JSON) Vol. 1 No. 1 (2019): September 2019
Publisher : Universitas Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/json.v1i1.1377

Abstract

The Water Resources Management Agency has the main duty to organize some district government affairs in the field of water resources management based on the principle of autonomy which becomes the authority, deconcentration and assistance duty and other tasks in accordance with the policy stipulated by the Regent based on the applicable laws and regulations. The performance appraisal undertaken in this agency is intended for the Civil State Apparatus. the assessment process is carried out for measuring and improving the performance of the State Civil Apparatus so as to encourage these employees to work better. From the assessment of the superior can be determined the best employee or promotion position. The performance appraisal process conducted by the culture and tourism office is still done manually, so the performance calculation tends to be subjective and takes a long time. Therefore, in order that the process of appraising employee performance becomes more objective and practical, it should be done computerized by developing an application that implements the right methods. This subjectivity can be overcome with decision support system using Simple Additive Weighting (SAW) method based on existing assessment criteria. The end result of research is the rank of employee value that can be a consideration for decision makers in the determination of promotions as well as an encouragement for employees to work better and productive.
Sistem Informasi Penyaluran Beras Miskin (Raskin) Kelurahan Desa Silau Malela Kabupaten Simalungun Heru Satria Tambunan; Sumarno Sumarno; Indra Gunawan
Jurnal Sistem Komputer dan Informatika (JSON) Vol. 1 No. 1 (2019): September 2019
Publisher : Universitas Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/json.v1i1.1378

Abstract

Village Office Village Glare Malela Simalungun in the distribution mechanism distributing rice for the poor there are many processes of data collection using either a computer technology that uses Microsoft Exel, and conventionally sometimes encounter problems in the process of distribution transaction poor rice resulting in frequent occurrence of data redundancy and data collection which takes quite a long time. Therefore, the author wants to make the application of Information Systems Distribution of Rice Poor (Raskin) In the Village Office Village Glare Malela Simalungun using Adobe Dreamweaver CS6 application and database MySQL. System development method used is by the Waterfall method. Given this information system inputting, searching and reporting can be performed quickly and accurately because the data is stored securely and structured
Rancang Bangun Sistem Pakar Penentuan Kepribadian Roki Hardianto; Chandra Kusuma
Jurnal Sistem Komputer dan Informatika (JSON) Vol. 1 No. 1 (2019): September 2019
Publisher : Universitas Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/json.v1i1.1385

Abstract

With the development of technology every time, all lines of life are computerized. Likewise, an expert system for determining personality types can help psychologists complete their tasks quickly, precisely and easily. Besides the lack of psychologists in handling cases of personality type analysis is an important note why an expert-based expert determination system is needed. In this study an expert system that was built using a desktop interface can also be based online. Not only when you meet a psychologist you can use it, but you can also use anyone using a PC or smartphone. This research uses the Case Based Reasoning method, where this method is a suitable method in the formulation of new knowledge of the examination of patients in the field of psychology. Referring to a study conducted by Florence Littauer who divided personality types into 4 parts namely Melancholy, Saguinis, Koleris and Plegmatis. It is hoped that this research can help patients and psychologists in analyzing and determining their personality precisely, quickly and easily

Page 50 of 76 | Total Record : 757

 48   49   50   51   52 

Filter by Year

2019 2026


Reset
Filter By Issues
All Issue Vol. 7 No. 3 (2026): Maret 2026 Vol. 7 No. 2 (2025): Desember 2025 Vol. 7 No. 1 (2025): September 2025 Vol 6, No 4 (2025): Juni 2025 Vol. 6 No. 4 (2025): Juni 2025 Vol. 6 No. 3 (2025): Maret 2025 Vol 6, No 3 (2025): Maret 2025 Vol 6, No 2 (2024): Desember 2024 Vol. 6 No. 2 (2024): Desember 2024 Vol. 6 No. 1 (2024): September 2024 Vol 6, No 1 (2024): September 2024 Vol 5, No 3 (2024): Maret 2024 Vol. 5 No. 3 (2024): Maret 2024 Vol. 5 No. 2 (2023): Desember 2023 Vol 5, No 1 (2023): September 2023 Vol. 5 No. 1 (2023): September 2023 Vol 4, No 4 (2023): Juni 2023 Vol. 4 No. 4 (2023): Juni 2023 Vol 4, No 3 (2023): Maret 2023 Vol. 4 No. 3 (2023): Maret 2023 Vol 4, No 2 (2022): Desember 2022 Vol. 4 No. 2 (2022): Desember 2022 Vol 4, No 1 (2022): September 2022 Vol. 4 No. 1 (2022): September 2022 Vol. 3 No. 4 (2022): Juni 2022 Vol 3, No 4 (2022): Juni 2022 Vol 3, No 3 (2022): Maret 2022 Vol. 3 No. 3 (2022): Maret 2022 Vol 3, No 2 (2021): Desember 2021 Vol. 3 No. 2 (2021): Desember 2021 Vol. 3 No. 1 (2021): September 2021 Vol 3, No 1 (2021): September 2021 Vol 2, No 3 (2021): Mei 2021 Vol. 2 No. 3 (2021): Mei 2021 Vol 2, No 2 (2021): Januari 2021 Vol. 2 No. 2 (2021): Januari 2021 Vol 2, No 1 (2020): September 2020 Vol. 2 No. 1 (2020): September 2020 Vol 1, No 3 (2020): Mei 2020 Vol. 1 No. 3 (2020): Mei 2020 Vol. 1 No. 2 (2020): Januari 2020 Vol 1, No 2 (2020): Januari 2020 Vol. 1 No. 1 (2019): September 2019 Vol 1, No 1 (2019): September 2019 More Issue