hardmultiple choiceObjective-mapped

A penetration tester gains a foothold on a Linux system with ASLR and NX enabled. The tester identifies a stack buffer overflow in a SUID binary. The binary has no PIE (Position Independent Executable) and is compiled without stack canaries. The tester wants to execute a shell. Which technique should be used?

Question 1hardmultiple choice
Full question →

A penetration tester gains a foothold on a Linux system with ASLR and NX enabled. The tester identifies a stack buffer overflow in a SUID binary. The binary has no PIE (Position Independent Executable) and is compiled without stack canaries. The tester wants to execute a shell. Which technique should be used?

Answer choices

Why each option matters

Good practice is not just finding the correct option. The wrong answers often show the exact trap the exam wants you to fall into.

A

Distractor review

Return-to-libc attack

Return-to-libc is a simpler form of code reuse that relies on calling a single libc function like system(). However, due to ASLR, the libc base address is randomized, making this unreliable unless a memory leak is available. The question does not indicate such a leak.

B

Distractor review

Heap spraying

Heap spraying is used to bypass ASLR by filling the heap with NOP sleds and shellcode, but it does not bypass NX (read: NX prevents execution on heap as well). It is less effective here.

C

Best answer

ROP chain

ROP chains use gadgets from the non-randomized binary (since it lacks PIE) to execute arbitrary code, bypassing both ASLR and NX.

D

Distractor review

Buffer overflow with NOP sled

A traditional NOP sled and shellcode injection would fail because NX prevents execution on the stack.

Common exam trap

Common exam trap: answer the scenario, not the keyword

Many certification questions include familiar terms but test a specific constraint. Read the exact wording before choosing an answer that is generally true but wrong for this case.

Technical deep dive

How to think about this question

This question should be treated as a scenario, not a definition check. Identify the problem, the constraint and the best action. Then compare each option against those facts.

KKey Concepts to Remember

  • Read the scenario before looking for a memorised answer.
  • Find the constraint that changes the correct option.
  • Eliminate answers that are true in general but not in this case.
  • Use explanations to understand the rule behind the answer.

TExam Day Tips

  • Underline the problem statement mentally.
  • Watch for words such as best, first, most likely and least administrative effort.
  • Review why wrong options are wrong, not only why the correct option is correct.

Related practice questions

Related PT0-002 practice-question pages

Use these pages to review the topic behind this question. This is how one missed question becomes focused revision.

More questions from this exam

Keep practising from the same exam bank, or move into a focused topic page if this question exposed a weak area.

FAQ

Questions learners often ask

What does this PT0-002 question test?

Read the scenario before looking for a memorised answer.

What is the correct answer to this question?

The correct answer is: ROP chain — Since NX prevents executing code on the stack, and ASLR randomizes library addresses, the best approach is to use return-oriented programming (ROP) with gadgets from the binary itself (which has a fixed address because it is not PIE). ROP chains allow the attacker to call functions like system() by chaining small instruction sequences (gadgets) that end with ret.

What should I do if I get this PT0-002 question wrong?

Then try more questions from the same exam bank and focus on understanding why the wrong options are tempting.

Discussion

Loading comments…

Sign in to join the discussion.