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

 5   6   7   8   9 
Implementasi Algoritme PRESENT untuk Proses Enkripsi pada Modul Komunikasi LoRa Fitra Firdaus; Ari Kusyanti; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 5 (2021): Mei 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Internet of Things (IoT) pada dasarnya merupakan gabungan dari dua komponen utama, yaitu internet dan things. Dalam mewujudkan visi IoT, teknologi Low Power Wide Area (LPWA) networks menarik banyak perhatian karena kemampuannya untuk menawarkan konektivitas yang terjangkau untuk perangkat berdaya rendah yang tersebar pada cakupan area yang luas (long range). LoRa adalah teknologi nirkabel unlicensed berdaya rendah (low battery consumption) yang memiliki jangkauan jarak yang cukup jauh dengan menggunakan teknik chirp-spread-spectrum(CSS), namun LoRa belum memiliki pengamanan pada proses pengiriman data. Dengan tidak adanya pengamanan pada LoRa, maka sangat rentan terhadap serangan oleh pihak yang tidak bertanggung jawab diantaranya adalah serangan sniffing. Untuk dapat menerapkan sistem keamanan pada data yang dikirimkan diantaranya adalah dengan menggunakan algoritme enkripsi PRESENT. Hal ini dibuktikan dengan hasil pengujian pada penelitian dengan melakukan serangan pasif menggunakan teknik sniffing serta serangan aktif menggunakan teknik Known Plaintext Attack (KPA). Pada serangan sniffing penyerang hanya mendapatkan data yang terenkripsi dalam bentuk chipertext sehingga data tidak dapat dibaca. Kemudian untuk hasil serangan KPA, penyerang tidak berhasil mendapatkan key algoritme. Dari hasil uji dengan menggunakan serangan sniffing dan KPA, maka dapat diambil sebuah kesimpulan bahwa implementasi algoritme PRESENT berhasil dalam melakukan pengamanan data yang dikirimkan menggunakan Lora.
Mitigasi Serangan Blackhole Pada Wireless Sensor Network Dengan Protokol Routing Aodv Menggunakan Algoritma Probabilitas Sequence Number Yanuar Alfianus Yosephan Raharjo; Dany Primanita Kartikasari; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 5 (2021): Mei 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Wireless Sensor Network (WSN) merupakan infrakstruktur jaringan yang dapat memudahkan dalam pemantauan pada sebuah objek. Penelitian ini menggunakan routing protocol AODV, protocol AODV memudahkan jaringan wireless sensor network dalam melakukan penentuan jalur pengiriman data secara mandiri. Protocol AODV memiliki kelemahan didalam pengiriman data. Blackhole attack dilakukan dengan mengirimkan paket RREP palsu ke dalam jaringan. Tujuannya untuk melakukan drop packet pada setiap pengiriman data antara source node dan destination node. Algoritma probabilitas sequence number merupakan mekanisme yang dapat digunakan untuk melakukan mitigasi blackhole attack pada jaringan wireless sensor network yang menggunakan protocol AODV. Mekanisme algoritma probabilitas sequence number dilakukan dengan cara memfilter sequence number sehingga hanya packet RREP asli yang dapat diterima oleh source node. Sequence number merupakan salah satu parameter yang terdapat pada paket RREQ dan RREP. Nilai parameter sequence number akan semakin bertambah setiap terdapat perubahan jalur yang digunakan. Hasil penelitian ini, algoritma probabilitas sequence number dapat memitigasi blackhole attack sebanyak 8 node dari 25 malicious node. Rata-rata packet loss sebesar 27,72 %. Rata-rata end to end delay sebesar 129.752 ms. Rata-rata packet delivery ratio sebesar 72,30 %.
Analisis Pengaruh Handover Terhadap Kinerja Video Streaming Menggunakan Protokol LTE Ryan Eko Listyanto; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 5 (2021): Mei 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

LTE (Long Term Evolution) is a technology that dominates the cellular network developments for mobile nodes currently. LTE can carry out handovers to increase network capacity and support services to mobile nodes. On the other hand, at this time, video streaming is becoming a popular service with mobile nodes support capable of accessing high-quality video and support for LTE as a high-speed network of up to 150 Mbps. However, the handover mechanism on LTE can affect service quality due to channel shifting between eNodeB that is influenced by various things, for example, the number of nodes served, packets sent, or a drop in the signal that occurs on both eNodeB. This research is conducted a handover simulation with several scenarios using a micro cell. The simulation is carried out with four scenarios, namely node speed, node density, the distance of two eNodeB, and the size of packets sent. In the simulation, the nodes will move linearly between two eNodeB for 1000 seconds to get the results of end-to-end delay, jitter, packet loss, and throughput. From this test, it was found that nodes that were moving too slowly had suboptimal results. The higher network load on testing node density and packet size decreases service quality but it is still in good condition for video streaming. Meanwhile, the decrease in signal strength can improve service quality at some point.
Implementasi Feige-Fiat-Shamir Identification Scheme untuk Autentikasi antara Node dan Gateway pada Module Lora Audi Fauzan Septano; Ari Kusyanti; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 7 (2021): Juli 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The authentication system using the Long Range (LoRa) module with the Wireless Sensor Network (WSN) mechanism still has problems. The problem lies in the security side of sending authentication data. The authentication that is carried out only matches the ID number as the identity of the sensor node that will communicate to the gateway node. This can cause unauthorized parties to easily break into the system. The Fiege-Fiat-Shamir (FFS) Identification Scheme authentication method is one method that implements the Zero-Knowledge Proof (ZKP) mechanism. The ZKP mechanism is an authentication method used to prove verifier, without providing confidential information or providing a way for other people to find out the confidential information. The authentication is done by matching the evidence generated from the key pair using the FFS identification scheme method. This research resulted in the FFS identification scheme authentication system being successfully implemented in the WSN mechanism using the LoRa module. Attacks carried out by using fake nodes to communicate and replay attacks with duplication of authentication data have been successfully overcome using an FFS identification scheme mechanism.The authentication validation level is 100% which is calculated using confusion matrix.
Implementasi Algoritme Speck Untuk Enkripsi One-Time Password Pada Two-Factor Authentication Moh. Ahsani Taqwim; Ari Kusyanti; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 7 (2021): Juli 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Static authentication is very vulnerable to attacks, Therefore, two-factor authentication is carried out by adding OTP as a factor in the authentication. However, even with all the conveniences offered by OTP, OTP is still very vulnerable to attacks, there are many attacks on OTP such as sniffling, wireless interception, etc. Therefore, it is necessary to have a second security for OTP. The SPECK algorithm provides excellent performance in both software and hardware, SPECK Family also has a variety of block and key sizes to match the application requirements and security needs without hindering the performance. OTP is encrypted with the SPECK algorithm to prevent attacks that directed at OTP. The OTP is encrypted with a key and sent to the user which is then sent back by the user to the system to be decrypted using the user's key. The validated OTP is then deleted to avoid duplicate OTPs. The testing of sniffing and KPA attack that was done to OTP was successfully prevented using SPECK algorithm. We can conclude that the result is invisible in sniffing attack testing, and the plaintext generated from KPA didn't match the main plaintext. The validation of the SPECK data is also true because it matches the test vector.
Perbandingan Kinerja Protokol AOMDV dan MP-DSR pada Mobile Ad Hoc Network (MANET) Anugerah Wijaya; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 10 (2021): Oktober 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Mobile Ad Hoc Network (MANET) is the development of wireless ad-hoc technology or now called Mobile Ad Hoc Network (MANET). The wireless interface becomes communication from one node to another and is also formed by several nodes. If a routing path can be optimal, then the routing protocol can include data exchange. Routing protocols analyzed include AOMDV and MP-DSR. The route discovery process is carried out when the source node will forward the destination node from the neighboring node that has received the packet. In MP-DSR, several destination nodes do mutual discovery, nodes will replace other alternatives if they experience troubIe during transmission. Packet delivery ratio, end to end delay, throughput packet loss, and convergence time are analysis of routing protocol performance parameters and tested through network simuIator 2. The conclusion from the analysis is that AOMDV routing protocol is better than the results of throughput, end to end deIay and normalized parameters. routing load, the averages obtained from the throughput of 26.200 kbps, the average value of the end to end delay is 159.3425 m/s and the normalized routing load is 0.7272. The MP-DSR routing protocol is better than the results of the packet delivery ratio and convergence time parameters, the averages of the packet delivery ratio are 0.998775% and the convergence time is 169.7896 m/s. The AOMDV routing protocol is better than the MP-DSR routing protocol seen from the Quality of Service (QOS) performance value of the increase in variation and node data packet size.
Algoritma Fuzzy Inference System sebagai Mitigasi Broadcast Storm pada Protokol Ad-Hoc On Demand Distance Vector (AODV) Selma Aulia Sekarrizky; Reza Andria Siregar; Rakhmadhany Primananda
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 12 (2021): Desember 2021
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 network without constantly infrastructure. MANET has a system that can manage itself from mobile nodes. Every nodes will find a routes sent from source nodes to destination nodes, this progress called routing. There are 3 category of routing protocols i.e. proactive protokol, reactive protocol and hybrid protocol. Ad-hoc On-Demand Distance Vector (AODV) is one of the example of reactive protokol. A routes will be formed if a nodes request for a transmission which is sent a route request packet (RREQ) from source nodes to destination nodes. if RREQ packets doesn't received by destination nodes or neighbors nodes, the source nodes will rebroadcast the RREQ packets until the destination nodes receive it and sent the route reply packets back with the same path. If it happens a lot, then flooding packets will occur. If flooding packets happens in a network, then congestion might happen and it called broadcast storm. Broadcast storm will impact redudancy packets, contention and collision. Fuzzy Inference System (FIS) is good for decision making case. So it can be a solution to mitigate broadcast storm. FIS will be used as Hello Interval specifier with network size and mobility as classification parameter. This research use nodes speed 0-10m/s and 0-5m/s as simulation parameters. The result is AODV with FIS and speed 10m/s has better result. AODV with FIS has lower routing overhead than original AODV for all nodes. AODV with FIS with speed 0-10m/s has 1% lower on nodes 150 and 200 which is in high category than original AODV. AODV with FIS with speed 0-10m/s has 12% and 8% higher on nodes 25 and 200 which is in low and high category.
Kinerja Protokol Destination Sequence Distance Vector (DSDV) terhadap Serangan Wormhole pada MANET Thelemanica Wicaksana; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 6 No 2 (2022): Februari 2022
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

MANET is a wireless network that consists of many mobile devices that serve as nodes. Dedicated infrastructure or centralized access points are not owned by this free tool. MANET has several types of routing protocols, namely reactive, proactive, and hybrid protocols. DSDV is an example of a proactive routing protocol. However, MANET networks can also be attacked. One example of his attack is Wormhole. A wormhole is an attack that consists of 2 or more nodes in pairs and forms a tunnel to transmit data between wormhole nodes. This study tested two scenarios, namely using attacks and without wormhole attacks. The test was carried out using NS-2.35 with each scenario using random waypoint movements and varying the number of nodes and the number of pairs of wormhole nodes. The test is based on the test parameters using QoS. The QoS parameters used are throughput, end-to-end delay, and packet delivery ratio. The best throughput results are in the scenario of 60 nodes without wormhole attacks of 0.78 kbps. The best delay is in the 60 node scenario using one pair of wormhole attacks of 3.57926 seconds in the end-to-end results. At the same time, the best packet delivery ratio results are in the 80 node scenario without a wormhole attack of 35.8974%.
Pencarian Jalur Alternatif berbasis Algoritme Yen's pada Jaringan Software Defined Network Dyan Krisyanto; Reza Andria Siregar; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 6 No 3 (2022): Mei 2022
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Software-Defined Networking or SDN is an architecture on a network that has manageable and adaptable properties, this will provide advantages when implementing it. Various examples of network applications that can be applied to SDN, for example is routing. With regard to routing, the routing path will be more efficient when the routing path that has been built can vary according to the actual situation on a network. So that if a problem arises such as a path failure on the active path or the path is not in accordance with the standard, then the path will always use the existing alternative path. The reactive nature of routing will make it easier for network administrators to monitor the network. In its application, routing needs an algorithm to find a path. In this research, Yen's algorithm is used to find alternative paths. The test is conducted to find out how the performance of alternative path search and the performance of Yen's algorithm is. The test results show that the response time test for searching paths under normal conditions gets an average of 6.245 seconds while for alternative route searches it gets an average of 50,825 seconds. Furthermore, for testing the recovery time gets an average of 159.68 seconds. Then the packet loss test obtained a value of 58.2%. The convergence time test does not show a significant difference based on the average results obtained on the normal path, which is 0.030 seconds and the average on the alternative path is 0.036 seconds.
Implementasi Autentikasi pada Protokol CoAP dan MQTT menggunakan Oblivious Transfer pada Perangkat IoT Puspita Ainunnazahah; Ari Kusyanti; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 6 No 13 (2022): Publikasi Khusus Tahun 2022
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Dipublikasikan di JEPIN (Jurnal Edukasi dan Penelitian Informatika)
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