hunt-brute-force

Tests authentication endpoints for missing rate limiting, OTP brute force, and user enumeration vulnerabilities.

1|Updated Aug 21, 2026
One-click install
npx skills add https://github.com/marcboggs/BMAD-AppSec-Orchestrator --skill hunt-brute-force-marcboggs
Or copy as Structured Prompt for Agent▼
Please help me install this Agent Skill.
Skill: hunt-brute-force
Source: https://github.com/marcboggs/BMAD-AppSec-Orchestrator/tree/main/.claude/skills/hunt-brute-force
Command: npx skills add https://github.com/marcboggs/BMAD-AppSec-Orchestrator --skill hunt-brute-force-marcboggs

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve? Security testers often misclassify rate-limiting defenses, reporting false negatives like "no rate limit" when an endpoint silently throttles requests, or failing to prove that an OTP keyspace is actually reachable. This Skill provides a disciplined methodology to correctly classify brute-force defenses and produce evidence-backed findings. ## Core Features & Use Cases - Four-state rate-limit classification: Distinguishes hard lockout, soft IP throttle, CAPTCHA injection, and silent shadow-throttling using status, latency, and body-size signals instead of just checking for HTTP 429. - OTP and password-reset brute-force testing: Probes 6-digit OTP keyspaces, measures throughput versus code lifetime to prove reachability, and tests IP-rotation bypasses via X-Forwarded-For and related headers. - Enumeration and token entropy analysis: Detects username/email enumeration via string, status, and timing oracles, and measures reset-token entropy with ent, Burp Sequencer, and structural analysis. - Use Case: During an authorized bug bounty engagement, you test a target's /api/verify-otp endpoint, run the shadow-throttle seed test to confirm the endpoint genuinely accepts unlimited attempts, then calculate that 50 req/s makes the 10^6 keyspace reachable in hours — a Critical ATO finding. ## Quick Start Ask the agent to test the target's login and OTP verification endpoints for missing rate limiting and username enumeration using the hunt-brute-force methodology.

Frequently Asked Questions about hunt-brute-force

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I test an OTP endpoint for brute force vulnerabilities?▼

Send a probe of 101 sequential codes against the verify-otp endpoint and watch for 429, lockout, or CAPTCHA responses. Then run a shadow-throttle seed test with a known-good code to confirm attempts are genuinely processed, and calculate whether throughput times code lifetime makes the 10^6 keyspace reachable.

How to detect username enumeration on a login page?▼

Compare responses for a known-valid versus a random invalid username across three signals: error message strings, HTTP status codes, and response timing. For timing oracles, sample at least 20-30 requests per case and compare medians, since single requests are noise.

Can X-Forwarded-For headers bypass IP-based rate limiting?▼

Yes, when the application trusts client-controlled source headers. Rotate headers like X-Forwarded-For, X-Real-IP, and CF-Connecting-IP with random IPs per request, then confirm the bypass by disabling rotation and showing the 429 response returns.

Why does no 429 response not prove rate limiting is missing?▼

Endpoints may silently shadow-throttle: returning normal 200/401 responses while dropping submissions server-side. Confirm by injecting a known-good credential mid-burst and verifying it still authenticates, while monitoring latency and body-size changes.

What tools does this methodology use for brute-force testing?▼

It uses curl for classified burst testing, ffuf with auto-calibration for OTP probing, hydra for login spraying, nuclei for default-credential templates, and Burp Sequencer or ent for token entropy measurement.

When is brute-force testing with this skill authorized?▼

Only against your own test accounts with explicit authorization, such as within a bug bounty scope. Full-keyspace exhaustion should never be run against third parties; severity is proven through reachability math instead.