Article Per Year (5 Year)
p-Index From 2021 - 2026
5.996
P-Index
This Author published in this journals
All Journal Jurnal Teknologi Informasi dan Ilmu Komputer Journal of Information Technology and Computer Science Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer IKRA-ITH Informatika : Jurnal Komputer dan Informatika
Reza Andria Siregar
Fakultas Ilmu Komputer , Universitas Brawijaya
Computer Science & IT Control & Systems Engineering Education Electrical & Electronics Engineering Engineering

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

Found 101 Documents
Search

 4   5   6   7   8 
Kinerja Protokol Greedy Perimeter Stateless Routing Protokol (GPSR) Menggunakan Roadside Unit (RSU) Pada Vehicle Ad-Hoc Network (VANET) di Area Kota Malang Ragil Setyo Utomo; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 10 (2020): Oktober 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Vehicular ad-hoc network (VANET) is a wireless network technology that allow vehivle can communicate with ohter vehicle. VANET have 3 way to communicate, that is vehicle to vehicle communication (V2V), infrastructure to vehicle (I2V) or (V2I), and infrastructure to infrastructure (I2I). This study focused at the distance placement in each road side unit (RSU). This study focused at the distance placement in each road side unit (RSU). Communication in VANET, its need good performance in sending data from vechile to vehicle for communication between vehicle to vehicle as well as vehicle to RSU or the other round can be delivered faster and the percentage of success information arrived is increasing. In this study protocol greedy perimeter stateless routing (GPSR) will be implement with RSU to know which distant in each RSU is better to implement. Implementation will be worked with Network Simulator (NS-2) and SUMO. The result from this implementation will be analyzed with test parameters that is throughput, end-to-end delay, and packet delivery ratio. From the result based on vehicle density, RSU with distant 300 m have better value, that is 1570 bps and 85,7143% compared from RSU with distance 400 m, that is 1530 bps and 500m with value 1520 bps. And also the value of packet delivery ratio for RSU with 400 m is 77,7778% and 500 m with 75%. However on implemention result based on vehicle speed, RSU with 400 distance 400 m have same performance with RSU distance 300 m. In other word, RSU placement with distance is taking effect toward routing performance.
Implementasi Autentikasi pada Protokol CoAP menggunakan Feige-Fiat-Shamir Identification Scheme Julio Dimitri Fredrik; Ari Kusyanti; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 11 (2020): November 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Authentication is a problem in Constrained Application Protocol (CoAP). JSON Web Token is one of standard in authentication mechanisms. However, this method has vulnerability in unsecure connection. This is due JWT authentication mechanism send hash secret directly. Feige-Fiat-Shamir (FFS) Identification Scheme is an authentication method apply Zero-Knowledge Proof (ZKP) mechanism. ZKP mechanism is based on knowledge to proof secret without reveal single bit on the secret. This research starts by making pair of secret. The device in this research is hard code by the each one of the secret pair. Then, authentication mechanism is done by proving the that the pairs of secret is valid using FFS Identification Scheme. This research result that FFS Identification Scheme can be use on CoAP authentication. Duplication secret on authentication mechanism by sniffing can be resolve by FFS Identification Scheme mechanism. This research also provides memory and authentication performance enhancement up to 256 bits secret.
Perbandingan Kinerja Protokol Routing HSR dan DSDV Pada Mobile Ad-Hoc Network (MANET) Khalid Hamzah Haza Al Hamami; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 11 (2020): November 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Mobile ad hoc Network (MANET) is a portable autonomous node network equipped with a wireless interface, which communicates via a wireless connection without centralized administration. This network can self-configure and maintain network topology dynamically without infrastructure support. Because the mobile node's transmission range is limited, each node has a dependency on neighboring nodes to forward packets. Qualitative data analysis is performed on the performance of Hierarchical State Routing (HSR) and Destination-Sequenced Distance-Vector (DSDV) protocols by interpreting data from test results in the form of throughput, average jitter, average end to end delay, packet data delivery ratio, route overhead and route convergence time. This study uses Network Simulator 2.35 with node density scenarios using variations in the number of nodes totaling 50 nodes to 120 nodes with multiples of 10 nodes. The best value of parameters throughput, average jitter, average end to end delay, packet data delivery ratio and route overhead are 189.312 Kbps, 27.18 ms, 2798.04 ms, 18.93% and 230.25. These results were obtained in the DSDV routing protocol, so it can be concluded that the DSDV routing protocol has better performance than HSR on the node density aspect. A better convergence value is obtained by the DSDV protocol with an average convergence time of 0.028617977 seconds.
Implementasi Algoritme Trivium dan Diffie-Hellman Key Exchange Pada Protokol CoAP Muhammad Alvian Syahputra; Ari Kusyanti; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 11 (2020): November 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Constrained Application Protocol (CoAP) is a communication protocol that was created for devices with constrained resources. Some of its feature are low header overhead and low parsing complexity which make CoAP a good choice for communication protocol in Internet of things (Iot) base system. However, this protocol does not have security feature, the data that was sent by this protocol can easily be seen by a sniffing attack which mean an attacker can easily read any confidential data that was sent by CoAP. One way to solve this problem is encrypting the data before sending it with CoAP so that an attacker cannot read the data. In this study, we build a simple client-server system that use CoAP as its communication protocol and also implement a stream cipher called Trivium with Diffie-Hellman key exchange (DHKE) to secure the data. The results from this study show that attacker can get the ciphertext only from doing a sniffing attack on the system and not the actual data. The system takes an average of 0.055414 second to encrypt data, an average of 0.058667 second to decypt the ciphertext, and an average of 1.741022 second to send a data which include doing handshaking proses, encrypting data and decrypting the ciphertext. Even though the system is capable to maintain data confidentiality, it still very vulnerable from attacks such as Active Man-in-the-Middle and Crib Dragging.
Implementasi Algoritme Enkripsi Homomorphic Schmidt-Takagi Versi 2 pada Sistem E-Voting Ivan Faturahman; Ari Kusyanti; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 11 (2020): November 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Securing ballots is an important aspect in upholding the principle of trust in e-voting, which means that public must have confidence in each instruments which form an e-voting. Fraud by the administrator can not be handled by implementing an encryption algorithm alone, because on many e-voting systems, administrator has task to do the decryption. Fraud on ballots from administrator can be avoided by not providing data ballots directly to administrator, this can be done by tallying the ballot. This method in cryptography can be done by using an encryption algorithm with homomorphic property. The new variation algorithm of Schmidt-Takagi algorithm found by three mathematicians and computer experts from the Tokyo Institute of Technology namely, Takato Hirano, Koichiro Wada, and Keisuke Tanaka has a homomorphic property. This algorithm was chosen because it is said to be faster in the encryption and decryption process than the Damgard-Jurik algorithm. At the end of implementing the algorithm, the average time taken by the system to encrypt with the majority of votes 1; 10; and 100 are 2,682ms, 2,893ms and 2,976ms. Then the average time for decryption with the same scenario are 1,459ms, 1,51ms, and 2,775ms.
Rekayasa Traffic Jaringan pada Protokol Destination Sequenced Distance Vector (DSDV) berdasarkan Penggunaan Energi dalam MANET Muhammad Ryan Firmansyah; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 11 (2020): November 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

MANET is a wireless network architecture where nodes can move freely and do not need to be connected to infrastructure. In MANET, all nodes act as a host and router that can receive and send data packets to other nodes. In addition, MANET also has limitation in energy usage. Nodes require sufficient energy resources when transmitting data packets. However, when the energy in the battery has been or will be depleted, that will cause process of data packet transmission to be disrupted. Therefore, limiting on energy usage are needed so data packets can be transmitted. The example protocol in MANET is Destination Sequenced Distance Vector (DSDV). By using the energy model contained in NS-3.30.1, DSDV protocol is integrated with the energy model in order to read the remaining energy during the data packet transmission process. There are two schemes; (1) Scheme without Traffic Engineering and (2) Scheme with Traffic Engineering tested. Traffic Engineering that is built is limiting the data packets that can be forwarded based on an energy level of 500 Joules. The results show that the scheme with Traffic Engineering saving energy usage in each number of nodes with a percentage are 0,112%, 0,03% and 0,033% whereas the highest Packet Delivery Ratio (PDR) value is all schemes without Traffic Engineering.
Implementasi Algoritme BLAKE2B Pada JSON Web Token Untuk Mekanisme Autentikasi Query Language Isnaini Isnaini; Reza Andria Siregar; Nurul Hidayat
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 1 (2021): Januari 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

GraphQL is a web-based client-server communication architecture for data communication using the HTTP protocol. GraphQL is divided into three parts, namely schema, query and resolver. In schema, there were two parts namely the query that functions to retrieve data and the mutation functions as updating data. The query had a function to display data from the server. Resolver here had a function as a connector between the schema function with the existing data. On the GraphQL, the HTTP protocol communication process ran without any authentication mechanism. The authentication mechanism worked so that the user account could access his own resources. JWT which was a token-based authentication mechanism was chosen to overcome the lack of authentication features in graphQL architecture. The HS256 algorithm was one of the algorithms implemented in JWT as a hashing algorithm. The HS256 algorithm belongs to the HMAC-SHA256 algorithm that used the message authentication code (MAC), so it was also called as HMAC-SHA256. In 2011 there were pre-image attack, so that they became threatened the security of the SHA256 algorithm in the following years. The BLAKE2B algorithm was an algorithm derived from the BLAKE algorithm as a hashing algorithm that used message authentication code (MAC). The security level of the BLAKE2B algorithm was better than the HS256 algorithm. This research implemented the BLAKE2B algorithm on JSON Web Token for query language authentication mechanisms and as an alternative to the HMAC-SHA256 algorithm. Several methods were functional system to test the suitability of the system and in accordance with the objectives, the vector-test examination was conducted to determine the suitability of the results between the algorithm implemented with the provisions contained in the RFC document, and time-authentication test was carried out to determine how long it took for the BLAKE2B algorithm to produce a message digest and it was obtained that BLAKE2B algorithm was 96% faster than HMAC-SHA256
Implementasi Metode Kompresi Gambar dari Node Sensor ke Node Server untuk Meningkatkan Efisiensi Waktu Pengiriman pada Jaringan 6LoWPAN Mohammad Harits; Adhitya Bhawiyuga; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 2 (2021): Februari 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Wireless Sensor Network has been able to be applied in agriculture to monitor the condition of agricultural land, namely regarding the humidity, pH, and temperature of the soil. However, this monitoring process cannot take pictures on the location because Wireless Sensor Network has the disadvantage of not being able to send large datas. To solve this problem, you can use a large capacity communication module so that more data is sent and also use the compression method for data to reduce the size of data before being sent. The communication module used in this study is 6LoWPAN. 6LoWPAN was chosen because it has advantages in terms of transmission capacity, range and has a low power consumption. There are 2 compression methods used, namely the DCT algorithm which is used to reduce interpixel redundancy and RLE to condense the results of the DCT algorithm so it can be smaller. The results obtained after testing are that the application of the compression method can save image size by around 24% from the size of the original image and reduce the total package sent by about 77% of the original packet. Delivery performance using the compression method has the advantage of sending time but decreases the success rate and increases average delay when sending image data.
Implementasi Blockchain pada Peer-to-Peer Transaction menggunakan Algoritma U-Quark Gibran Akbaromi Luhkito; Ari Kusyanti; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 4 (2021): April 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Blockchain is a database system that has a decentralized architecture, where every data contained in the blockchain system is spread across all peers that are connected in the blockchain system. One of the most discussed blockchain uses is cryptocurrency, which was coined by Bitcoin. In the hashing process on the blockchain system used by Bitcoin using the SHA-256 algorithm, a weakness has been found of the SHA-256 algorithm, namely the preimage attack using the biclique concept on the compression function owned by SHA-256. This is what underlies the author to implement blockchain in peer-to-peer transactions using the U-Quark algorithm. The author uses the U-Quark algorithm because the architecture owned by the Quark Family hashing uses a combination of block ciphers and stream ciphers owned by Katan and Grain for permutations and uses Sponge Construction as its constructor. There are 3 factors tested in this study, namely test vectors, functional, and availability. In vector testing, the resulting digest value is the same between the implemented U-Quark algorithm and the digest value that has been determined in the hashing family Quark. In functional testing using the blackbox method with 100% valid results. The Availability tester generates the same data in every peer available in the blockchain system. The U-Quark algorithm consists of 3 stages, namely the initialization phase, the absorbing phase, the squeezing phase, and the blockchain system built involves 2 types of systems, namely the blockchain system and the wallet system. The blockchain system functions as a storage system and a wallet system as a place to enter transactions into the blockchain system.
Implementasi Metode Ephemeral Diffie Hellman Over Cose (EDHOC) pada Wireless Sensor Network (WSN) sebagai Mekanisme Autentikasi berbasis Modul Komunikasi LoRa I Gede Wahyu Sanjaya; Adhitya Bhawiyuga; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 4 (2021): April 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

In general WSN can be build with one node and one gateway. Comunication between node sensor and gateway using other device that support wireless network as bridge such as LoRa. WSN with LoRa does not have authentication system. If considering in few years, system without continous authentication also has a big risk so that is became a requirement to have countinous authentiction. With countinouse authentication node and gateway can still recognize their valid pair. Give more protection while comunicating. Use Ephemeral Diffie Hellman Over COSE (EDHOC) method as alternatif solution for fixing problem with key management approach. For reducing other party or illegal attacker probability of sniffing and eavesdropping while communicating. The result of this research found out system generate new key based on time configuration that already set for updating key authentication. Other than that performance system after applying countinous authentication has a significant effect such as does not impact delivery time and giving extra protection while communicating.
Co-Authors Abyantara, Za’da Achmad Basuki Achmadi, Adrian Adam Hendra Brata Adam Syahputra Adhitya Bhawiyuga Adhitya Bhawiyuga, Adhitya Aditya Prayudhi Ahmad Aji Santoso Ahmad Faiz Ahmad Hanif AR Ahmad Lutfi Bayu Aji Ahmad Rizal Muttaqin Aladina, Yohanna Fransiska Alldo Raafi'ilman Andi Mohammad Thareq Akbar Annisa Widuri Murti Utami Anugerah Wijaya Ardhian Rizki Ramadhani ari kusyanti Ari Kusyanti Asika Ayu Wandira Asroful Khusna Arifianto Atha, Mochamad Audi Azzura Falaq Audi Fauzan Septano Bangsa, Rehan Putra Chandra Yogi Adhitama Cut Naurah Cassrisa Daffarez Elguska Dahru Wildan Pradanaputra Danny Candra Rumantyo Dany Primanita Kartikasari Dany Primanita Kartikasari Dany Primanita Kartikasari Destyorini, Diah Ratih Donny Kurniawan Dyan Krisyanto Dzaki, Alvin Pradano Ekky Pramudito Setiawan Eko Aditya Ramadianto Eldyto Puspa Laksana Fadhlan Muhammad Fariz Andri Bakhtiar Faruqi, Ibrahim Zhilal Fauzan Pahlawan Fedro Jordie T. H. Simangunsong Fitra Firdaus Gibran Akbaromi Luhkito Haidar Harfi Hadhiansah Heru Nurwarsito Hidayatus Syafa'ah Hilkya Dwima Palembangan Hilmy Riadika I Dewa Gede Ardana Pucanganom I Gede Wahyu Sanjaya I Made Oka Semara Putra Imaduddin, Muhammad Fakhri Imam Nurhidayat Imam Utomo Iman Aidil Nugraha Indra Lesmana Putra Isnaini Isnaini Ivan Faturahman Jaliasmar, Rendy Putra Jogi Oliver Yohanes Tampubolon Julio Dimitri Fredrik Kasyful Amron Kasyful Amron Khalid Hamzah Haza Al Hamami Labib Imam Hidayat Mahardika Yuristyawan Putra Mahendra Data Maxi Luckies Ginanjar Azis Miftaqul Novandi Moh. Ahsani Taqwim Mohammad Harits Mohammad Rizky Dwisaputra Muhamad Ralfi Akbar Muhammad Alfarizi Muhammad Alif Bahari Muhammad Alvian Syahputra Muhammad Ichwan Pradana Muhammad Muhajir Kurniawan Muhammad Reza Wahyu Chrisdyan Muhammad Ryan Firmansyah Muhammad Syaifuddin FP Muhammad Taufiq Aryadi Mulyadi, Yonathan Fanuel Nur Cahyo Utomo Nurovi Andiyani Nurudin Santoso Nurul Hidayat Pramukantoro, Eko Sakti Prasetyo Eko Yulianto Primantara Hari Trisnawan Puspita Ainunnazahah Ragil Setyo Utomo Rakhmadhany Primananda Rakhmadhany Primananda, Rakhmadhany Rakhmashany Primananda Ravy Agistya Alkamaly Retno Nizma'urrahmi Rian Bayu Pambudi Risqi Nuril Aimah Rivai Fansuri Nasution Rizky Suhaimi Robbani, Dwindra Helmi Rozali Syahputra Ryan Eko Listyanto Selma Aulia Sekarrizky Siska Irawati Sutrisno, Bagasdio Tasrahmiati Istiqomah Thelemanica Wicaksana Tiara Erlinda Tommy Bona Hamonangan Sitorus Trisnawan, Primantara Hari Tsany Afif Ula Auliya Ilham Irsahnda Widhi Yahya Widhi Yahya Yanuar Alfianus Yosephan Raharjo Yosua Tito Sumbogo Yudhanto, Alif Alamsyah