Exploiting Authentication Weaknesses in DVWA: A Brute Force Attack Methodology

Low Security Level The authentication endpoint lacks both input validation and rate-limiting mechanisms. Credentials transmit via insecure GET requests and concatenate directly into SQL queries without sanitization. <?php if (isset($_GET['Login'])) { $input_user = $_GET['username']; $input_pass = $_GET['password']; $hash_pass = m ...

Posted on Sun, 18 Oct 2026 16:24:53 +0000 by raccer

Brute-Force Solutions for Smith Numbers and Counting Inversions

Finding the Next Smith Number A Smith number is a composite integer n such that the sum of the decimal digits of n equals the sum of the decimal digits of all its prime factors, counting multiplicities. To example, 666 = 2 × 3 × 3 × 37 gives digit sums 6+6+6 = 18 and 2+3+3+3+7 = 18. A brute-force procedure can be designed to locate the smallest ...

Posted on Thu, 08 Oct 2026 16:04:02 +0000 by chandler

Automated Correctness Checking Using Random Input and Brute Force Oracles

A common technique to catch logical errors in a efficient algorithm is to compare its output against a slower brute-force implementation on many small, random generated test cases. The setup below uses the least common multiple (LCM) of two integers as the target problem. Scripts and their roles All components are implemented as standalone Pyth ...

Posted on Thu, 27 Aug 2026 16:32:52 +0000 by BinaryStar

Maximum Balanced Subrectangle in a Binary Matrix

Given a (n \times m) matrix where each cell contains either 0 (white) or 1 (black), a subrectangle is considered balanced if the number of black cells equals the number of white cells inside it. The task is to find the area (total number of cells) of the largest balanced subrectangle, or 0 if none exists. Both (n) and (m) are at most 10, which ...

Posted on Sun, 24 May 2026 20:53:20 +0000 by KPH71

Solving Programming Problems Using Brute Force Techniques in C/C++

Overview Brute force methods involve systematically enumerating all possible solutions to find valid answers. This approach is particularly useful in competitive programming contexts like the Blue Bridge Cup, where problems often require checking combinations or permutations within defined constraints. Problem Solutions Problem 1: Hundred Coins ...

Posted on Thu, 21 May 2026 17:38:21 +0000 by jacko310592

Determining Feasibility of Safe Aircraft Landing Sequence with Single Runway

Problem Description N aircraft are preparing to land at an airport with only one runway. The i-th aircraft arrives above the airport at time Ti and has enough remaining fuel to continue circling for Di units of time. This means it can begin landing at the earleist at time Ti, and at the latest at time Ti + Di. The landing process itself require ...

Posted on Sun, 17 May 2026 06:05:57 +0000 by inkfish

Simulating 3D Hat Color Transformations with Cube Queries

A cube of side length n holds hats arranged in a 3D grid. Each hat has an uppercase letter color, initially G for green. Implementation uses an integer representation where 'A' maps to 1 and 'G' maps to 7 via the formula int(letter)-64. Supported operations within axis-aligned rectangular regions: Paint all hats within a specified sub‑cube wit ...

Posted on Sat, 09 May 2026 11:39:01 +0000 by HyperD