Claim Missing Document
Check
Articles

Implementasi Algoritme SPECK dan SHA-3 Pada Database Rekam Medik Hilman Adi Kartika; Ari Kusyanti; Mahendra Data
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 12 (2018): Desember 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1366.567 KB)

Abstract

Medical record data has to be protected because the data contains personal data about medical history owned by patients and doctors. However in recent years, many cases of attacks or hacking are found. This study aims to secure data records on the database. To secure the data by applying the SPECK algorithm is implemented to ensure data confidentiality and SHA-3 algorithm to ensure the integrity of the data. SPECK algorithm is applied to the name, address, description, and symptom fields of the patient table, while the SHA-3 algorithm is applied to the user table's password field. Tests conducted in this study are, validation test vector, encryption and decryption validation, performance time of encryption and decryption, system functionality, and non-functionality system. The results of the test shows that test vector, encryption and decryption test are valid. The execute time of encryption and decryption on average is 11,2 milisecond for encryption and 11,295 milisecond for decryption. Functionality of the system runs according to function, and non-functional systems can run well on various web-browsers such as Microsoft Edge, Mozilla Firefox, Google Chrome, and Opera.
Perancangan dan Implementasi Algoritma Enkripsi Idea pada Perangkat Kriptografi Berbasis FPGA Muhammad Adi Wijaya; Wijaya Kurniawan; Ari Kusyanti
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 12 (2018): Desember 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (330.752 KB)

Abstract

The use of text data applications is currently growing rapidly, even now many applications are switching to embedded systems. Many users choose to switch to embedded systems because they are more efficient, cheap, and have a fast response so it does not endanger the quality of the submitted text data. One of the embedded systems used today is the use of personal digital assistants or PDAs. The need for a PDA as a wireless communication tool is very important to be noticed, because the data sent through the communication may be company data that cannot be known by anyone. Tapping cellphones / PDAs on wireless communication often occurs. To solve the problem, information security is needed to complete the needs of the data security on PDAs / cellphones. Information security used to resolve these problems is using the IDEA algorithm. The IDEA algorithm is used because it provides high level security based on complex secret keys. The step taken to implement this algorithm is a system needs analysis to find out all the needs needed by the system to be built and tested, after that the system design is done using the Xilinx Spartan FPGA 3-e as a simulator before it can be designed directly on cryptoprocess integrated circuit, then the system design results will be implemented on the FPGA and will be displayed on the PC. After the system is implemented it will be tested and analyzed using functional testing, validity, and execution time. Based on the results obtained the text data encryption implementation with IDEA method can be implemented on FPGA Xilinx Spartan 3-e and generate ciphertext to encrypt existing data and test results using functional testing and validity give 100% correct system results and generate a text data encryption with text data encryption time of 7.788ns.
Analisis Hasil Perbandingan Penerapan Metode Heuristic Evaluation Menggunakan Persona dan Tanpa Persona (Studi Kasus : Situs Web Female Daily) Atika Baladina; Ismiarta Aknuranda; Ari Kusyanti
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 12 (2018): Desember 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (815.406 KB)

Abstract

This study aims to analyze the differences in results of usability evaluation using Heuristic Evaluation method without Persona and with Persona. In this study, there are three main steps to get the desired results: making Persona, heuristic evaluation and the analysis of the results, both without Persona and with Persona. The making of Persona in this study using qualitative Persona which start with interviewing 20 respondents who were users of Female Daily Network website. This interview aims to understand users' characteristics and behaviors when accessing the website. Data obtained from interviews is used to build Persona. Website then evaluated using heuristic evaluation method without Persona and heuristic evaluation method with Persona. Each evaluation is carried out by three different evaluators. Results of evaluations from both methods then compared for analysis. Comparison seen from the difference in number of problem findings, graph of the number problems found from each evaluator, problem categories based on severity rating, and differences in heuristic categories that were successfully met from the problems found. The results of this study indicate that evaluations using Heuristic Evaluation method with Persona managed to identify more usability problems than Heuristic Evaluation method without Persona.
Implementasi Algoritme Grain V1 Untuk Enkripsi Gambar Pada Aplikasi Berbasis Web Andhika Brahmana Putra; Ari Kusyanti; Mahendra Data
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 12 (2018): Desember 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1273.549 KB)

Abstract

The challenge of dealing with illegal copying and distribution of multimedia documents is an important problem to be solved. Different techniques have been introduced such as encryption and digital watermarking to protect the data from unauthorized parties. In this study, data encryption is carried out in image format through web-based applications by using the Grain algorithm. Grain algorithm has an advantage of that it reduces the value of complexity and increases the speed of computing. Tests carried out are test vector validation testing, encryption and decryption validation testing, encrytime performance testing and security testing. The result of test vector, encryption and decryption validation test are valid. For encryption and decryption execution time of each image file extension resulted the longest execution time is on JPG extension files while the shortest execution time is on BMP.While for security testing obtained sniffing results using Wireshark which shows that the encrypted data is unknown to an authorized party. The conclusion of the above test is that the Grain algorithm can be performed by applying an image encryption mechanism that can protect data confidentiality.
Implementasi Algoritme Trivium Untuk Mengamankan Komunikasi Data Master-Slave Pada Perangkat Berbasis Modul Komunikasi NRF24L01 Sara Yosephina; Adhitya Bhawiyuga; Ari Kusyanti
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 12 (2018): Desember 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (919.952 KB)

Abstract

Internet of Things (IoT) is a network concept that connects various devices so that these devices can produce services and cooperate with each other to achieve common goals. Security is one of the weaknesses of IoT implementation. Trivium algorithm is a hardware-side security candidate by the eSTREAM Project organized by NIST. Trivium algorithm architecture has a complex level of complexity and does not require large power so it is suitable for use on devices that have low power. This study explains how to utilize the Trivium algorithm to secure data communication using NRF24L01. There are 5 tests performed including validation test vector, performance analysis through the validation time keystream and data encryption ecryption, performance analysis of delivery time from master to slave using communication module NRF24L01, and testing with sniffing. Results of this resesarch indicate that the keystream validation in accordance with test vector. The performance of encryption processing time has an average of 695.8 ms for 8 bit data size, 951.2 ms for 16 bit data size and 1460.2 ms for 32 bit data size. And the results of the decryption processing time performance have an average of 443.5 ms for 8 bit data size, 447.8 ms for 16 bit data size and 448.4 ms for 32 bit data size. And the results of the test by sniffing shows that the Trivium algorithm can perform data encryption well with the sniffing process can only sniff the data that has been encrypted.
Perancangan Sistem Pengamanan Data Transaksi Pada Database Terdistribusi Menggunakan Metode Hashing Agung Pambudi; Ari Kusyanti; Mahendra Data
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 1 (2019): Januari 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (426.752 KB)

Abstract

In e-commerce, payment outlets are needed as intermediaries, so that purchase can be processed. One of e-commerce in Indonesia is owned by PT. Kereta Api Persero Tbk. The interconnection of transactions on several payment outlets requires a database distribution. This will cause new problems, because the database has a security gap, namely the possibility of transaction data manipulation. Therefore a system that can guarantee transaction data cannot be manipulated is needed. The hashing method is used to calculate the digest value of incoming transactions from payment outlets. Then, the digest value will be sent in turn with transaction data to the online ticket server. Afterward, the digest value from the previous transaction and the latest transaction will be recalculated and resulting a new digest value. This proces is repeated until a hashing chain is created. In this way the payment records will be the same and each data record will be bound. Hence, changing one data record transaction, will damage the composition of the other transaction data records. The composition of a valid data record will be an indication of data integrity of data transaction. This system is implemented successfullywith execution time of every record calculation takes approximatelly 5 seconds.
Analisis Performa Proses Enkripsi dan Dekripsi Menggunakan Algoritme AES-128 Pada Berbagai Format File Rohbi Visdya Harris Chandra; Ari Kusyanti; Mahendra Data
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 1 (2019): Januari 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (371.105 KB)

Abstract

Every company has data that must be stored in digital form. Along with the development of the company, the data that needs to be stored will be more and more, so that the storage space needed will also be greater. In addition, data security factors also need to be considered. One method of securing data is by encrypting data. In the research conducted is an encryption algorithm analysis, which according to the results of the analysis shows that the AES algorithm shows an algorithm recommended as an algorithm to secure file usage. This study proposed an analysis of the AES encryption method. There are several parameters for testing the encryption method, namely encryption costs, computation time and testing several file formats encrypted and decrypted with file size references for document and image file formats, for audio and video file formats referring to the time duration, then from each file format selected two file extensions used for testing. Based on the results of the test shows that the AES encryption method provides good results for a number of file formats, AES-128 is able to encrypt files well even though it requires a long computing time in some of the file extensions tested. The time needed for the encryption and decryption process using the AES algorithm is affected by each different file size, the larger the file size used, the longer computation time needed.
Implementasi Algoritme Trivium Stream Cipher Dan Shamir's Secret Sharing Pada File Portable Document Format (PDF) Muhammad Wahyu Rizqi Pratama; Ari Kusyanti; Mahendra Data
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 1 (2019): Januari 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (837.65 KB)

Abstract

Securing data in the form of files by encrypting the files is one way to secure data in the concept of cryptography, so that other people who are not entitled to find files that are private or confidential. In this study implementing data security using two cryptographic algorithms namely Trivium Stream Cipher and Shamir's Secret Sharing. Both algorithms are applied to a *.pdf format document file. * .pdf document file format is a file format that is widely used when sending files because it can be distributed on any computer with the same look. But with the development of technology, the security of this file also weakens like tapping or losing. Therefore we need a method that can improve the security of this * .pdf format document file. It is expected that by combining these two algorithms can improve security in * .pdf format files. From the testing that has been carried out this system requires an average execution time of 2.363 seconds for a file size of 15 Kb, 6.384 seconds for a file size of 31 Kb and 12.456 seconds for a file of size 40 Kb.
Analisis Performa Algoritma SPECK Pada Raspberry Pi Panji Mansyur Ansyah; Mochammad Hannats Hanafi Ichsan; Ari Kusyanti
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 1 (2019): Januari 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (469.962 KB)

Abstract

Cryptographic algorithms are logical steps for hiding messages from people who are not entitled to the message. Security in hardware is also very important when the values ​​generated from sensors and other processes are sent via the internet, the data is not easily known by third parties. The SPECK algorithm is the latest encryption algorithm created by the National Security Agency (NSA). SPECK block Cipher has 10 types of blocks consisting of the smallest 32 bits up to the largest 128 bit block. This research was conducted to determine the performance of the SPECK algorithm when applied to Raspberry Pi. In this study using data collection methods and testing carried out as much as 1024 times on each SPECK algorithm. SPECK that will be tested is SPECK block 128 bit size with key size 128 bits, 192 bits and 256 bits. The results of the study concluded that the processing time of the SPECK algorithm to encrypt and decrypt plaintext with an average time of 85920μs - 91073μs. RAM consumption for all algorithms requires 0.5% on the Raspberry Pi, the CPU is only used when the program runs at 2.6%. Data analysis calculations were tested by the Kruskal-Wallis method and produced data from the study experiencing significant differences from each encryption and decryption process on the SPECK block size 128 bit algorithm with 128-bit, 192-bit and 256-bit key variants.
Implementasi Algoritme Grain Untuk Pengamanan Data Rekam Medis Yoga Rizwan Priyatna; Ari Kusyanti; Mahendra Data
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 4 (2019): April 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1092.12 KB)

Abstract

Medical record is a document that contains personal data and history of treatment from a patient in a hospital. Medical record are sensitive and confidential so any person or party cannot read the information of the patient's medical record. In case of a hospital cannot provide the best care for the patient, it allows patient referred to other hospital that have better resources and involve the exchange of patient's medical record. Medical record exchange needs a secure system that can guarantee the confidentiality and integrity of data at the time of the delivery process. This research will implement of Grain v1 algorithm and Secure Hash Algorithm (SHA-3) for safety medical record exchange between hospital. Grain v1 is an algorithm to ensure the confidentiality of data on the exchange process by doing encryption and decryption of data. SHA-3 is hashing algorithm to ensure the integrity of the data. Grain v1 algorithm and SHA-3 has been through the vector test to validate the architecture of algorithm in the system are made. The result states that Grain v1 algorithm can perform encryption with an average time 0.0077450 seconds and decryption requires the average time 0.0145436 seconds.
Co-Authors Adam Syahputra Adhitya Bhawiyuga Aditya Bhawiyuga Aditya Rachmadi Admaja Dwi Herlambang Agung Pambudi Agung Setia Budi Ahmad Faiz Ajeng Nurrohmah Alan Maulana Hamid Aldila Amalia Saufika Alex Sandro Irawan Ali Arifin Ami Fajar Hikmah Andhika Brahmana Putra Andi Reza` Perdanakusuma Andy Jaya Hartanto Angger Ramadhan Aniela Cahya Ningroem Apriyanto Tobing Arimbi Dewayanti Arsana Yudistira Arya Seta Bagaswara Aryo Pinandito Atika Baladina Audi Fauzan Septano Aulia Rizqy Pratama Bagus Priyambada Bagus Satria Wiguna Bhaskara Vito Tarigan Candra Emelia Fransisca Cindy Farah Safira Dany P Kartikasari Dany Primanita Kartikasari David Christanto Dian Astika Rini Dimas Dwi Radhityo Dita Nurina Malinda Dwi Qunita Putri Ambeq Paramarta Enrico Dimas Darmawan Evi Oktavia Kurniawati Fairuz Risky Yusniasari Fani Madina Fanny Aulia Rifki Fariz Andri Bachtiar Fariz Andri Bakhtiar Fida Royani Firlhi Kurniawan Firman Eko Purnomo Fitra Abdurrachman Bachtiar Fitra Firdaus Fredianto Fredianto Gibran Akbaromi Luhkito Hadyan El Aufar Halimah Septya Mikayla Hanaria Rotua Tampubolon Harin Puspa Ayu Catherina Helmy Rafi Nawawi Heru Nurwarsito Hilman Adi Kartika Himawat Aryadita I Putu Agrahita Wiguna Indriyana Liliasari Rahma Yusvi Irfan Arif Afandi Iskar Maulana Ismiarta Aknuranda Ivan Faturahman Iwi Suharti Izzati Dalilah Jihad Kamilullah Julio Dimitri Fredrik Kalbuadi Joyoputro Karmila Dewi Sulistyowati Kasyful Amron Kasyful Amron Khusnatul Mukaromah Lina Andreina Luqman Hakim Yumnun Lutfi Fanani Luthfi Maulana M. Ali Fauzi Mabda Amnesti Hananto Maharani Essraningtiyas Mahendra Data Mega Noviany Mega Shero Gayatrie Mochamad Chandra Saputra Mochammad Hannats Hanafi Ichsan Mochammad Valdi Fuadi Moh. Afif Ma'ruf Moh. Ahsani Taqwim Mohammad Fachry Muhammad Adi Wijaya Muhammad Alvian Syahputra Muhammad Faizal Ismail Muhammad Iqbal Rofi'i Muhammad Isfa Hany Muhammad Khatib Barokah Muhammad Nurul Fanani Muhammad Thareq Parsaulian Beyri Muhammad Wahyu Rizqi Pratama Muhammad Zainul Mubarok Nadya Puspitasari Ngr. Putu Raka Novandra Asta Nico F. Sitorus Niken Hendrakusma Wardani Ninscha Adisti Oktivianet Novia Dwi Setyaningrum Novita Krisma Diarti Nungki Dwi Prastanti Nur Azizah Mutmainnah Nuretha Hevy Purwaningtyas Nurjannah Nurjannah Nurma Abadi Firjatulloh Nurovi Andiyani Nurul Syamsi Ekowati Odytri Caesar Mahayani Okta Dwi Ariska Olivia Very Noorlinda Panji Mansyur Ansyah Pramasita Gustiarum Pramukantoro, Eko Sakti Primantara Hari Trisnawan Puspita Ainunnazahah Rafi Fajar Hidayat Raka Kurnia Novriantama Rakhmadhany Primananda Randyka Rusniantoro Ratna Khansa Anantika Retno Indah Rokhmawati Retno Nizma'urrahmi Reza Andria Siregar Reza Andria Siregar Richie Mahfud Ahmed Sambora Rifa Izza Nurlita Rika Mardatilla Rivai Fansuri Nasution Rizal Dismantoro Rizka Amalia Kurniawati Rizki Nanda Mustaqim Rohbi Visdya Harris Chandra Sabriansyah Rizqika Akbar Sandy Ramadhan Wijaya Sara Yosephina Sartika Amalia Sastra Ginata Sepdiyah Ayu Ningrum Septian Visiano Handoko Suhadak Akbar Supraptoa Supraptoa Syahifudin Shahid Syahmi Rifqi Hudha Perwira Tista Pamungkas Ragil Alit Widhi Yahya Wijaya Kurniawan Winda Ayu Safitri Yazid Yazid Yoga Rizwan Priyatna Yogi Anugrah Yohanes Heryka Febriarso Yulius Adi Pratama Yuniar Siska Fatmala Yusi Tyroni Mursityo Yustiyana April Lia Sari Zuroul Mufarokah