This Author published in this journals
All Journal Jurnal CoreIT
Nur Widyasono
Unknown Affiliation

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

Found 1 Documents
Search

PERFORMANCE COMPARISON OF LINEAR SEARCH, BINARY SEARCH, AND TERNARY SEARCH ALGORITHMS IN EXPLOITING TIME-BASED BLIND SQL INJECTION VULNERABILITIES ON WEB APPLICATIONS Rizkie Irfan Awaludin; Nur Widyasono; Rohmat Gunawan
Jurnal CoreIT: Jurnal Hasil Penelitian Ilmu Komputer dan Teknologi Informasi Vol. 12 No. 1 (2026): June 2026
Publisher : Fakultas Sains dan Teknologi, Universitas Islam Negeri Sultan Syarif Kasim Riau

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24014/r0wxb656

Abstract

SQL Injection remains one of the most serious security threats to modern web applications. One variant, Time-Based Blind SQL Injection (TBB-SQLi), is a type of attack that is difficult to detect because it does not display direct output, but instead uses a delay as an indicator of successful injection. The main problem with this technique is that the exploitation process is slow and requires many repeated requests. This study aims to develop a Python-based TBB-SQLi exploitation automation system by applying three search algorithms, namely Linear Search, Binary Search, and Ternary Search, to accelerate the process of extracting sensitive data from the target database. The evaluation was based on two main parameters, namely runtime and number of requests, in six sleep delay scenarios (1–6 seconds). The experimental results show that Binary Search provides the most efficient performance with a runtime of 2,054–11,007 seconds and 1,945–2,113 requests. Ternary Search ranked second with a runtime of 3,720–10,361 seconds and 2,652–4,552 requests, while Linear Search produced the longest execution time, 3,780–6,932 seconds, with the highest total requests reaching 6,167. The developed system is capable of automatically extracting database names, tables, and administrator credentials. Overall, Binary Search proved to be the most optimal in balancing time efficiency and number of requests in Time-Based Blind SQL Injection exploitation.