Article Per Year (5 Year)
p-Index From 2019 - 2024
0.61
P-Index
This Author published in this journals
All Journal Seminar Nasional Informatika (SEMNASIF) Indonesian Journal of Information System Aiti: Jurnal Teknologi Informasi Prosiding Seminar Nasional Sains Teknologi dan Inovasi Indonesia (Senastindo) Abdimas Altruis: Jurnal Pengabdian Kepada Masyarakat
Bambang Soelistijanto
Unknown Affiliation
Humanities Computer Science & IT Control & Systems Engineering Education Engineering Environmental Science Mechanical Engineering Social Sciences Other

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

Found 7 Documents
Search

 1 
IMPLEMENTASI AUTHENTIKASI CLIENT DENGAN METODE “TWO WAY CHALLENGE-RESPONSE” PADA TRANSAKSI PERBANKAN ELEKTRONIK Soelistijanto, Bambang
Seminar Nasional Informatika (SEMNASIF) Vol 1, No 3 (2010): Network And Security
Publisher : Jurusan Teknik Informatika

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

Abstract

Dengan semakin maraknya penggunaan Internet untuk transaksi elektronik, maka diperlukan sebuah sistem yang dapat menjamin keamanan transaksi ini dari ancaman pihak yang tidak berkepentingan. Salah satu aspek penting keamanan transaksi elektronik yang akan dibahas pada paper ini adalah masalah authentikasi client oleh server. Authentikasi client dimaksudkan untuk mem-verifikasi keaslian/kebenaran identitas client sebelum transaksi dapat diproses lebih lanjut. Salah satu cara yang umum adalah client mengirimkan password atau PIN (Personal Identification Number) sebagai awal identifikasi seperti pada transaksi di anjungan tunai mandiri (ATM). Namun bila transaksi elektronik dilakukan melalui jaringan Internet maka sangatlah rentan jika password/PIN dikirimkan secara langsung. Ada 2 model authentikasi client di Internet yaitu menggunakan protokol transaksi web yang aman (misal https) dan protokol ‘challenge-response’. Pada paper ini akan dibahas mengenai implementasi protokol ‘two way challenge-response’ pada transaksi perbankan elektronik melalui layanan web. ‘Challenge-response’ protokol diimplementasikan dengan menggunakan fungsi hash MD-5 dan pembangkit bilangan random. Selanjutnya, protokol ini dianalisis untuk menguji unjuk kerjanya dengan menggunakan beberapa uji statistik yang ada. Dari analisis yang ada dapat disimpulan bahwa MD-5 dapat bekerja baik karena kebal terhadap collision resistance pada kode hash yang dihasilkannya dan juga memiliki avalanche effect pada outputnya jika dibandingkan terhadap bit inputnya.
PELATIHAN PEMBUATAN MEDIA AJAR DAN SIMULASI UJIAN ANBK BERBASIS DARING Vittalis Ayu; Bambang Soelistijanto; Henricus Agung Hernawan; J.B. Budi Darmawan; Bernadeta Wuri Harini; Martanto Martanto
ABDIMAS ALTRUIS: Jurnal Pengabdian Kepada Masyarakat Vol 5, No 1 (2022): April 2022
Publisher : Universitas Sanata Dharma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24071/aa.v5i1.3910

Abstract

The education sector is one of the most impacted areas of the COVID-19 pandemic. Schools, which generally hold offline meetings, now have to transform into online sessions. With this pandemic, the teaching process must be "forced" to be online. The assignment model is usually given in physical mode (questions on paper, done and collected) is no longer relevant because of the limitations of physical meetings. On the other hand, students need an explanation from the teacher directly because they are familiar with the context of offline learning. Judging from the lack of computer ownership, whether owned by students or their parents, the technological literacy of the student and the teacher is required to carry out this teaching and learning process properly. To answer this problem, the Informatics and Electrical Study Program at Sanata Dharma University held training activities for making teaching media for SD Negeri Sawah teachers, who ultimately played an important role in improving teachers' technological literacy in carrying out online learning. In addition, at the school's request, we also held a phase 2 training targeting fourth-graders in preparation for the ANBK, a computer-based national exam they had to pass in the following year, which successfully increased the student's confidence to sit the test. 
ANALISIS KINERJA ROUTING PROTOKOL SPRAY AND WAIT DI JARINGAN OPPORTUNISTIC Maria Irmgrad Ratu; Bambang Soelistijanto
AITI Vol 14 No 1 (2017)
Publisher : Fakultas Teknologi Informasi Universitas Kristen Satya Wacana

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

Abstract

Opportunistic Network (OppNet) is a wireless network that doesn’t need any infrastructure in the formation.Opportunistic Network can not guarantee a path between the source and destination at any time. In this research, the authors tested the Epidemic Routing Protocols and Spray And Wait Routing Protocol using ONEsimulator. Performance metrics used are Delivery Probability, Overhead Ratio, Average Latency, Buffer Occupancy and Number of Drop messages. Parameters used in each test is the area that remains with the addition of the number of nodes, increasing the buffer size, the addition of the Time-To-Live (TTL), increasing the number of copies of the message (L Copy), and the increase in the number of nodes and the number of copies (%).Epidemic Routing Protocols Tests showed an increase on the Delivery Latency Average Probability, it’s because Epidemic Routing Protocol always leave copy of messages every time they met with a relay node without regard to resources. While Spray and Wait Routing Protocols is good at it because Overhead Ratio in Spray and Wait is low because of number of copies limitation. But delay in Spray and Wait  s very high compared to the Epidemic, it is because Spray And Wait limits the number of copies. From the simulation that involved buffersize addition. Delivery probability in epidemic routing protocol reached an optimum number of 95%, meanwhile delivery probability in SnW protocol reached 73.24%, thus, in every 100 messages sent, 73 messages are successfully delivered.
Analisis Kinerja Protokol Routing Social Aware Berbasis Konten Pada Opportunistic Network Ricky Yonas; Bambang Soelistijanto
AITI Vol 14 No 2 (2017)
Publisher : Fakultas Teknologi Informasi Universitas Kristen Satya Wacana

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

Abstract

Opportunistic Networks (OppNet) is one of Delay Tolerant Network (DTN) application. It is a wireless communication that is not require any infrastrusture thus, the difference between OppNet and conventional cellular communication is obvious. In OppNet, nodes are communicating via other node’s radiowave (in this case, we used Bluetooth). Messages are handed over node by node until it reaches its destination node. In social aware routing protocol, social weights are given to each node. Social weights will determine node’s movement and it’s transitivity or even it’s community to help messages reachs it’s destination faster. With transitivity, the delivery probability can reach an optimum number of 80%, that means in every 10 messages, 8 messages are successfully delivered.
Analisis Unjuk Kerja Protokol Spray and Focus di Jaringan Opportunistic Maria Hilary; Bambang Soelistijanto
AITI Vol 15 No 1 (2018)
Publisher : Fakultas Teknologi Informasi Universitas Kristen Satya Wacana

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (566.346 KB) | DOI: 10.24246/aiti.v15i1.67-74

Abstract

Delay Tolerant Network (DTN) is a wireless connection which does not need infrastructure in its formation. In this research the writer test the performance of a spray and focus routing protocol in opportunistic network using ONE SIMULATOR. Performance matrix used are delivery probability, overhead, delay, and drop. Scenario used in every test are increasing the number of nodes, increasing the number of copy pesan, additional TTL (time-to-live), and addition of buffer capacity. The test result show that spray and focus routing protocol is better in working day movement when TTL is increasing because spray and focus uses transitivity to choise the best relay node so the message can reach its destination in a shorter time even though nodes are often forming a community. The delivery probabilty reached 99.4% which is mean in every 100 messages, 99 messages are sucessfully delivered to destination node.
Analisis Kekaburan Cipherteks Hasil Perulangan Enkripsi Vigenere dan Transposisi Columnar Cipher Gregorius Magnus Mega Sanjaya; Bambang Soelistijanto; Vittalis Ayu
Prosiding Seminar Nasional Sains Teknologi dan Inovasi Indonesia (SENASTINDO) Vol 2 (2020): Prosiding Seminar Nasional Sains Teknologi dan Inovasi Indonesia (Senastindo)
Publisher : Akademi Angkatan Udara

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

Abstract

Keamanan data merupakan hal yang penting. Salah satu hal yang dapat dilakukan untuk menjaga kerahasiaan data menggunakan cipher untuk menyandikan data. Penelitian ini menggabungkan Vigenere dan Transposisi Columnar serta penambahan iterasi pada proses enkripsi. Parameter yang digunakan untuk mengukur kinerja cipher gabungan ini adalah avalanche effect dan rnnning time. Analisis periodicity juga ditambahkan untuk menganalisis pengaruh dari Vigenere dan Transposisi Columnar terhadap persentase kekaburan yang dihasilkan oleh iterasi yang dilakukan terhadap cipher gabungan ini. Hasil penelitian menunjukkan bahwa penggunaan gabungan Vigenere-Transposisi maupun iterasi, keduanya menghasilkan persentase kekaburan yang lebih tinggi dibandingkan hasil enkripsi dengan Vigenere cipher saja. Namun running time untuk iterasi cipher gabungan ini sangat tinggi. Hal ini mengindikasikan beban komputasi yang besar. Pola perulangan yang terjadi pada hasil persentase kekaburan dari Iterasi-Vigenere-Transposisi dipengaruhi oleh perubahan kolom pada Transposisi Columnar cipher. Semakin banyak jumlah kolom pada Transposisi Columnar maka periode perulangannya akan semakin pendek.
Implementation of Group-Based Human Movement Model in Opportunistic Network Vittalis Ayu; Bambang Soelistijanto
Indonesian Journal of Information Systems Vol. 5 No. 1 (2022): August 2022
Publisher : Program Studi Sistem Informasi Universitas Atma Jaya Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24002/ijis.v5i1.6164

Abstract

As an instance of a distributed computing system, opportunistic networks facilitate message dissemination in a store-carry-forward manner. In this setting, the mobile devices are communicating in opportunistic contacts as they move across the network areas. However, the movement of these mobile devices is exclusively reliant on the mobility of their human owner, thereby limiting the likelihood of contact. The current state of the art typically simulates human movement based on randomness, which is unsuitable for representing how people move in groups. Therefore, this paper proposes an implementation of a group-based human mobility model to simulate device-to-device communication in opportunistic networks. In this model, individuals are able to move as a set within a group and have the ability to join and leave the group dynamically We built the model in BonnMotion and subsequently implemented it in an opportunistic environment simulator, ONE Simulator. To evaluate the proposed model, we compared them to the random-based model as a benchmark. Subsequently, we assess the impact of the movement model on two major areas of network performance: message delivery performance and resource utilization, such as nodes’ energy consumption. We are concerned about these aspects since the mobile agents have limited resources yet are expected to achieve a high rate of message delivery as well. The simulation results show that our model outperformed the random-based model in terms of the number of successfully delivered messages and average delay. However, the number of message replications and the energy consumption is fairly higher than those of the benchmarks.
Co-Authors Ayu, Vittalis Bernadeta Wuri Harini Gregorius Magnus Mega Sanjaya Henricus Agung Hernawan J.B. Budi Darmawan Maria Hilary Maria Irmgrad Ratu Martanto Martanto Ricky Yonas