/reverseengineering-intro

Reverse Engineering Examples

Primary LanguageC

Resources

Required

Optional

  • binutils
  • binwalk
  • build-essential
  • IDA 7.0

Examples

Sample 1

Three implementations of functions that compute the fibbonaci sequence.

Demonstrates function calls, looping, and recursion with a well known algorithm.

make && ./fib

Sample 2

An example of reading in structured data from disk.

Useful for teaching cross references, function calls, defining structures, and memory allocation.

Challenges

Challenge 1 - Philadelphia 1776

Features a progressive discovery of:

  • Cross references
  • Hardcoded password/input
  • Loop counting
  • Reading from file
  • Defining structures
  • Complex comparisons