rop-development-dev
Auth/lab dev: ROP chain research; gadget quality, calling conventions, pivots, leak-first ASLR labs, NX/DEP modeling, reliability.
v2026.11.13-21cd5683 установки+3 за 7 дней39 ЗвездыMITсинхронизировано 11 часов назад
Установка
Ещё нет NotHoly CLI? Сначала установите её.
$ curl -fsSL https://notholy.com/install.sh | sh$ notholy skills install aeondave/rop-development-devПишет в ~/.notholy/skills после проверки подписи и SHA-256.
ПодписьПодписано, ed25519
Пакет0d8b07ef…fe6aff2e
0d8b07efa9b1…9b02fe6aff2e4 файла · 6.1 KBПроверкаНизкийзамечаний нет
Источникgithub.com/AeonDave/malskill/tree/main/offensive-coding/rop-development-dev@21cd568
Эта запись еще не переведена на русский, поэтому показан текст на другом языке: English.
На странице
Goal: produce reliable, reproducible chains — not one-shot lucky payloads. Build from ABI facts, memory disclosures, and deterministic gadget policies.
When to activate
- You need a chain for
ret2libc,ret2syscall,ret2csu, SROP, or Windows API-call ROP (VirtualProtect,NtProtectVirtualMemory) - Exploit crashes exist but NX/DEP + ASLR/PIE prevent direct shellcode
- Gadget discovery returns too many noisy candidates and chain stability is poor
- A working chain breaks across OS versions or minor binary rebuilds
- You must reason about CET/Shadow Stack / CFG feasibility before investing in ROP
Core operating model
- Establish control primitive: RIP control + controllable stack window.
- Choose objective:
- Leak addresses (stage 1) for ASLR/PIE
- Invoke function/syscall with controlled arguments (stage 2)
- Change memory perms (RW->RX) or pivot to existing executable pages
- Collect gadgets deterministically (Ropper/ROPgadget/pwntools), score, then freeze selection.
- Assemble chain using exact ABI (register args, stack alignment, shadow space on Windows x64).
- Validate under debugger and rerun multiple times against same binary + randomized layouts.
- Generalize by replacing hardcoded addresses with leak-derived bases and symbol offsets.
Agentic execution loop (recommended)
- Survey pass: protections, ABI, candidate primitives, chain budget (input length / bad chars).
- Hypothesis: pick the shortest viable route (e.g.,
ret2libcvsret2csuvsret2dlresolvevs SROP). - Prototype: build the smallest chain that proves one objective (single leak or single call).
- Instrument: log gadget addresses, leak bytes, parsed base, and alignment state (
rsp % 16). - Replan: if a gate fails (canary, full RELRO, CET/CFG), switch route early rather than extending a broken chain.
- Stabilize: replay locally with randomization, then with remote-like libc/loader parity.
Chain patterns that actually survive
Leak-first (preferred)
- Stage 1: call a known print/write primitive (
puts@plt,write, etc.) on GOT/IAT pointer. - Compute module base from leak.
- Stage 2: build final chain from base + offsets.
Use this by default on ASLR/PIE targets instead of guessing static offsets.
ret2libc / ret2syscall (Linux)
pop rdi; ret->/bin/sh->system, or- syscall chain: set
rax=59,rdi=/bin/sh,rsi=0,rdx=0, thensyscall; ret.
ret2csu (ELF with limited gadgets)
Use __libc_csu_init sequences to load multiple registers when clean pop gadgets are missing.
Windows API-call ROP
- Build register/stack state for
VirtualProtectorNtProtectVirtualMemory. - Respect x64 calling convention and stack alignment.
- Prefer module-backed return sites/gadgets for better call-stack plausibility.
Mitigation-aware decisions
- NX/DEP on, no leak yet: prioritize infoleak stage.
- PIE + full ASLR: absolute gadget addresses are disposable; keep only relative offsets.
- Full RELRO: avoid GOT overwrite plans; use call-oriented chains/leaks instead.
- No/Partial RELRO:
ret2dlresolvecan be a strong option when direct libc resolution/leaks are constrained. - CET Shadow Stack: classic RET-chain often non-viable without a compatible bypass primitive.
- CFG (Windows): indirect call targets must pass CFG checks; prefer allowed call edges or syscall-oriented paths.
If CET/CFG blocks your intended path, pivot early to alternate technique (JOP/SROP/data-only).
Gadget quality rules
- Prefer shortest side-effect-free gadgets.
- Reject gadgets that clobber required registers unless immediately restored.
- Avoid random candidate picking: sort + score + choose deterministically.
- Preserve a strict fallback cascade (module A -> B -> C) when ideal gadget not found.
- Re-verify every selected gadget after binary/toolchain updates.
Reliability checklist
- Stack 16-byte aligned at each call boundary.
- Bad bytes filtered at payload generation time.
- Chain survives repeated runs (at least 20 local iterations).
- Leak parsing robust to partial output / newline differences.
- All hardcoded bases removed before finalization.
- Local environment mirrors target runtime (
libc/loader parity) before remote claims. - Ifunc-sensitive offsets (
mem*,str*families) validated at runtime when relevant.
Debug loop
- Build minimal chain (single call objective).
- Break before first gadget; inspect stack and registers.
- Single-step gadget transitions; confirm intended side effects only.
- Expand chain one block at a time.
- Record failure class: bad pivot, alignment, clobber, wrong base, mitigations.
Anti-patterns
- Treating ROP as static addresses under ASLR/PIE.
- Overlong chains when a shorter call-oriented path exists.
- Mixing conventions (SysV vs Windows x64) in cross-platform exploits.
- Ignoring tool disagreement (Ropper vs ROPgadget) without byte-level verification.
- Shipping chains not tested under randomized layouts.
Resources
- references/tooling-and-workflow.md — Load when selecting gadget tooling, debugger flow, and leak/chain instrumentation.
- references/reliability-patterns.md — Load when chains work once but fail across runs, libc variants, or layout changes.
- references/examples-and-resources.md — Load for compact chain templates and common failure fixes such as alignment, IFUNC, CET, CFG, and leak instability.
- Upstream methodology:
offensive-techniques/binary-exploitation-technique(when to choose ROP vs data-only, chain staging) andoffensive-ctf/pwn-ctf/references/rop.md(concrete chain recipes).
Файлы этой версии
references/37.5 KB
- examples-and-resources.md1.3 KB
- reliability-patterns.md3.4 KB
- tooling-and-workflow.md2.8 KB
- SKILL.md6.1 KB
Права
| Право | Заявлено | Найдено проверкой |
|---|---|---|
| Читает файлы | Нет | Нет |
| Пишет файлы | Нет | Нет |
| Выполняет команды shell | Нет | Нет |
| Ходит в сеть | Нет | Нет |
| Использует коннекторы | Нет | Нет |
| Управляет браузером | Нет | Нет |
Замечания проверки
Проверено 13 нояб. 2026 г.
Проверка не нашла в этой версии ничего подозрительного.
Чистая проверка снижает риск, но не доказывает, что пакет безопасен. Читайте то, что ставите.
| Версия | Опубликована | Коммит | SHA-256 | Подпись | Изменение прав |
|---|---|---|---|---|---|
| v2026.11.13-21cd568 | 13 нояб. 2026 г. | 21cd568 | 0d8b07ef | Подписана | – |
Ещё от AeonDave
Всё от этого издателяЕще в категории «Реверс-инжиниринг и фаззинг»
Вся категорияСпрашивайте обо всём, что позволяет ваш скоуп.
Создайте аккаунт, пополните баланс и задайте первый вопрос в чате или в терминале.
- 1/3
Создайте аккаунт
Личный или для компании. Позже можно перейти на аккаунт компании без потери баланса и ключей.
ЛичныйКомпания - 2/3
Пополните баланс
Картой. Оплата за токены, без подписки.
$5.00минимальное пополнение - 3/3
Спрашивайте
В чате, или установите CLI и выполните notholy login в терминале.
$ notholy login