Claim Missing Document
Check
Articles

Analisis Perbandingan Algoritma Advanced Encryption Standard Untuk Enkripsi Short Message Service (SMS) Pada Android Fredianto Fredianto; Ari Kusyanti; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 10 (2018): Oktober 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Short Message Service (SMS) is a popular service among mobile phone users in Indonesia. The biggest security gap in SMS communications is that it can read messages and save them to the Short Message Service Center (SMSC) when an SMSC attack occurs. One solution to solve the problem is by encoding messages that are sent or better known as encryption. In this research, AES 128 AES, AES 192 bits AES and AES 256 bits are used for SMS message encryption on Android. The Elliptic Curve Diffie-Hellman (ECDH) protocol is used in key exchange mechanisms for encryption and decryption of messages. In this study obtained the longer the data will be the longer the process of encryption and decryption. In this research, there is no significant performance difference, it is proved by ANOVA test which has been done with each data length.
Pengamanan Data pada Media Penyimpanan Cloud Menggunakan Teknik Enkripsi dan Secret Sharing Mohammad Fachry; Ari Kusyanti; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 11 (2018): November 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Cloud computing is a technology that used to store data online. With only internet connection, store and access data can be an easy task. However, cloud computing technology also cause some security problems. Cryptography is a study of how data can be secured. Therefore, applying cryptography in cloud computing environment is not a new thing. New algorithms and combination between them is expanded and studied to ensure security aspects such as confidentiality, integrity and availability. In this research, a system is built with applying 2 methods of cryptography, encryption and secret sharing to ensure data. Data that is ensured will be store at 2 different type of media storage namely cloud storage and laptop's internal storage. The test shows all the security functions work well.
Implementasi Algoritme Speck untuk Enkripsi dan Dekripsi pada QR Code Yuniar Siska Fatmala; 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 (984.066 KB)

Abstract

Along with the development of technology, emerging new technologies are predicted to replace the function of the barcode. The technology is QR code technology. Quick Response Codes or QR codes are two-dimensional barcodes developed by Denso Wave Corporation in 1994. The QR Code is capable of storing information that is large enough therefore the QR Code needs to be secured because currently there is a lot of piracy of a code, which will harm someone or a related agency. There are several efforts to maintain data confidentiality so that it is not misused, one of which is by implementing the SPECK algorithm. SPECK is a family of lightweight blockcipers published by the U.S. National Security Agency. in 2013. From the results of the SPECK algorithm implementation can be concluded that this application can encrypt all types of characters in the form of strings, letters, numbers or symbols that need to be secured, and when decrypting the QR Code the application will activate the camera function and scan the QR Code that will become plainntext again. This is evidenced in security testing which proves that the results of ciphertext are very different from plaintext. The execution time of encryption and decryption can be proven by testing the performance of encryption time with the total performance required time is 0.061614036560059 seconds and in testing the performance of the decryption time total performance of the time taken is 0.0039241313934326 seconds.
Implementasi Algoritme Blake2s pada JSON Web Token (JWT) sebagai Algoritme Hashing untuk Mekanisme Autentikasi Layanan REST-API Bagus Satria Wiguna; Ari Kusyanti; Widhi Yahya
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 (1106.597 KB)

Abstract

REST is a web-based client-server communication architecture. REST server provides data in the form of URL to be accessed by client in JSON form. The disadvantage of current REST architecture is the lack of authentication mechanism which allows anyone to access, change, or delete data. To solve the authentication problem from REST architecture, is required an authentication system. JWT is a token that is proposed to authenticate and ensure message integrity. Using JWT on the REST architecture can provide authentication and security. In JWT Implementation there are various hash algorithms used, one of them is HMAC-SHA256 algorithm which is SHA256 algorithm using message authentication code (MAC). In 2011, the vulnerability of SHA256 is found which is preimage attack and pseudo collision attacks. BLAKE2S algorithm is an algorithm created in 2012 succeding BLAKE algorithm. BLAKE2S algorithm offers better security since it is built with HAIFA iteration and ChaCha stream cipher. This research implemented BLAKE2S algorithm on JWT for REST API service authentication mechanism as alternative HMAC-SHA256 algorithm. Test-vector is performed to ensure the test-vector given in RFC document. The Authentication process of BLAKE2S is 88.583 ms.
Implementasi Algoritme Kriptografi Lizard untuk Mengamankan Pengiriman Data Menggunakan Arsitektur Web Service REST pada Mikrokontroler NodeMCU Kalbuadi Joyoputro; Ari Kusyanti; Fariz Andri Bakhtiar
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 (1259.514 KB)

Abstract

There are three elements of security, which are data confidentiality, data integrity, and data availability. This research focuses data confidentiality on NodeMCU microcontroller device in an IoT environment. Relatively small NodeMCU processor and dynamic memory becomes a challenge in fulfilling the data confidentiality. Lizard stream cipher algorithm is implemented on NodeMCU. The JSON (JavaScript Object Notation) data will be encrypted into a cipher text using the Lizard algorithm keystream before being sent to the database server over the wireless wifi network. On the server side, the data will be decrypted into its original form and stored into the database. The process of sending data uses the REST (Representational State Transfer) web service architecture. There are four parts of testing to ensure the system has been running well, that is test vector validation testing, functional testing, time and memory performance testing, and security testing. The 216 and 352 bit keystream generated on NodeMCU devices takes 0.01 seconds and 3.4% of total dynamic memory, while encrypting 216 and 352 bits plain text takes 0.02 and 0.04 seconds with 0.3% of total dynamic memory. Implementation of Lizard algorithm has successfully guaranteed the data confidentiality.
Implementasi Algoritme SPECK Pada Proses Pengiriman File Multimedia Melalui Jaringan Internet David Christanto; 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 (1153.087 KB)

Abstract

Audio recording is one of the multimedia files that are often encountered today. One example is the sound recording that can be used as evidence in the trial of the law. The proof of sound recording is supported by UU No 11 Tahun 2008 Pasal 5 ayat 1 regarding information and electronic transactions that stated : "Electronic information and / or electronic documents and / or prints are legal evidence". Therefore, sound recording is very important to be kept secret from an unauthorized party. This study focuses on the aspect of confidentiality. This research implements SPECK algorithm to encrypt audio recordings. DHKE is also implemented as a public key exchange algorithm. Execution time encryption and decryption is performed by using various files extension and the duration of different audio recordings. The time of encryption and decryption of each file extension is slightly different. The execution time difference of encryption and decryption is less than 23 seconds. The results show that the file extension does not affect the execution time. The execution time is affected by the size of the file, whichs mean the bigger the size of the file, the longer the execution time.
Implementasi Algoritme Lizard untuk Pengamanan Protokol MQTT pada Perangkat NodeMCU Rizal Dismantoro; 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 (1369.598 KB)

Abstract

The Message Queuing Telemetry Protocol (MQTT) protocol is one of the IoT protocol which has a mechanism based on topic-based publish-subscribed systems that have properties that are suitable to be implemented on devices that have limited resources. This is due to it has light-weight properties. MQTT is one of the protocols that is often used on IoT, but there are several weaknesses in the security issues. To ensure the data security an algorithm is needed to encrypt data. One of security algorithm for encrypting data is the Lightweight Stream Cipher for Power-constrained Devices (Lizard) algorithm. In the publisher section before the message is sent it will be encrypted (ciphertext). In broker the ciphertext will forward to the subscriber. In the subscriber, the message will be decrypted. Based on the test results, the Lizard algorithm implemented in the MQTT protocol successfully secure a system on NodeMCU device that take 1014419 microsecond.
Implementasi Algoritme Grain V1 Pada Protokol MQTT Menggunakan Raspberry Pi Untuk Mengamankan Data IoT Iskar Maulana; Ari Kusyanti; Adhitya Bhawiyuga
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 (561.016 KB)

Abstract

Internet of Things (IoT) is one of the most commonly used technologies today because IoT can connect various devices. In general, the protocol used in IoT is the MQTT protocol that utilize wireless as a medium for data exchange. However, wireless media is vulnerable to wiretapping. Data threats become an unavoidable so there is a need secure the data. One technique for securing data is Grain v1 algorithm. This algorithm is an algorithm in cryptography that is used to encrypt and decrypt messages. The author uses Raspberry Pi as a publisher and subscriber as well as a Virtual Machine (VM) as a broker. The Grain v1 algorithm is placed on each client (publisher and subscriber) so that when the payload is transmitted over the MQTT protocol, the data contained in the payload is encrypted. Likewise, the payload is decrypted after it is received by the subscriber. There are 5 tests to ensure that the system works well including test vector validation testing, system functional, validation testing, encryption and decryption results, sniffing, and time performance. The result shows that test vector validation, encryption and decryption process validation are valid. Functional test shows that system can run well. Based on sniffing test, the payload cannot be read by unauthorized party. Finally, the execution time of processing keystream, encryption and decryption take 0.01246 second, 0.01627 second, and 0.02238 second.
Implementasi Algoritme Trivium Untuk Mengamankan Data Pada Protokol MQTT Menggunakan Perangkat Raspberry Pi Alan Maulana Hamid; Ari Kusyanti; Adhitya Bhawiyuga
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 (1356.465 KB)

Abstract

MQTT Protocol (Message Queuing Telemetry Transport) is widely used in wireless communication medium on IOT (Internet of Things). On the other hand, the use of wireless medium has a disadvantage. As an example, the data are highly vurnerable to eavesdropping (sniffing data). The dangerous impact of eavesdropping or sniffing is that the loss of security. Therefore, it is required to have a mechanism to ensure data security. Trivium algorithm is one of the cryptographic synchronous encryption cryptographic algorithms used to secure data and Trivium is tested well and Trivium is assigned as a stream cipher encyption algorithms by ISO/IEC 29192-3; 2012. Raspberry Pi is used as a publisher, subscriber and virtual machine as a broker. Publisher will encrypt the data before the data and topic are sent to the broker. Broker will forward the data to the subscriber that is subscribed. After the data is received by the subscriber, the data will be decrypted into plaintext. Here are the results of the study; keystream result to the vector test is valid, validation result of encyption and decryption is valid, the result of sniffing data of Wireshark shows that the data cannot be read by an unofficial authority, and the result of six functional systems showed that all of the functional work well, the result of the average time to produce keystream is that 0.034886725 seconds, encryption process is that 0.047045873 seconds and decryption process is that 0.053834003 seconds
Implementasi Algoritme Advance Encryption Standard (AES) pada Enkripsi dan Dekripsi QR-Code Dwi Qunita Putri Ambeq Paramarta; 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 (449.48 KB)

Abstract

Data security are very important in today's technological development. Therefore, it is necessary to find a way to protect the confidentiality and the security from unauthorized accesses. One of the mechanism to increase data security is to use cryptography. There are many form of cryptography, one of them is Advance Encryption Standard Algorithm. This thesis uses AES Algorithm with the size of 128 bit expansion key. That will operate in a 4x4 array. In the state encryption process will go through several stages of Addroaundkey, Subbyte, Shiftrows, and Mixcolumns 10 times round. But in the last round Mixcolumns no longer process directly into the Addraoundkey process, and for the decryption process is a reverse process of the encryption process that InvAddrows, InvShiftrows, InvSubbyte, and InvMixcolumns use the same round key with the encryption process. AES is implemented in PHP programming language and applied to QR-Code because it is a labeling technology that can store data in the form of patterns that can be filled with information. From the results of the implementation of AES Algorithm can be concluded that this application can encrypt all types of characters in the form of strings, alphabet, numbers, and symbols. When decrypting QR-Code the application will activate the camera function and perform QR-Code scanning that will be plaintext again. The execution time of AES encryption and decryption is 0.0034 seconds for the encryption process and for the decryption process takes 0.0029 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