Skip to content

Lesson pack 3 · Foundation · 60 minutes

Hashes, identification and cracking

Identify a digest by shape, understand why hashing is one-way, and learn where wordlist cracking works and where it is a trap.

Print this page for a paper plan - the navigation and links drop out.Student-facing version

Before the session

  • Nothing to install. Students need a browser and https://ctfpal.com. Confirm the room can reach it once; after that it works offline.
  • Read the lesson yourself first - about 6 minutes.
  • Have one worked example ready to paste. The classroom link builder on the instructor page turns it into a URL that opens preloaded.

Objectives

Written as things a student can do afterwards, so they can be assessed rather than asserted.

  1. Identify a hash from its length and prefix, and name the ambiguities that length alone cannot resolve
  2. Explain the difference between encoding, encryption, and hashing
  3. Crack a fast unsalted hash with a wordlist and rule transforms
  4. Recognise a deliberately slow hash and choose a different approach

Running order (60 min)

TimeWhat happens
0:00-0:06Frame the problemWhat the category looks like when you meet it cold, and why the naive approach fails.
0:06-0:18Teach the methodThe technique itself, on the board or from the lesson. No tools open yet.
0:18-0:33Demonstrate liveSame technique, in the workspace, on your worked example. Narrate every choice.
0:33-0:54Practice setStudents work the challenges. Circulate rather than present.
0:54-1:00Checkpoint and wrapCollect the artefact, name what comes next.

Tools used

  • Hash identifier with hashcat mode lookup - Identify a hash from its shape and prefix - MD5, SHA family, bcrypt, NTLM, and the salted formats - and get the hashcat mode number to crack it.https://ctfpal.com/?tool=hash-identifier
  • MD5, SHA-1 and SHA-256 hash generator - Compute MD5, SHA-1, SHA-256, SHA-384, and SHA-512 of any text in the browser, using Web Crypto. Nothing is sent anywhere.https://ctfpal.com/?tool=hash-generator
  • In-browser hash cracker with rule transforms - Crack MD5, SHA-1, SHA-256, SHA-384, and SHA-512 against a wordlist in your browser, with leetspeak, case, reversal, and digit-append rules.https://ctfpal.com/?tool=hash-cracker
  • SHA-3, BLAKE2, Keccak and RIPEMD calculator - Compute the hash functions outside the standard set - SHA-3, Keccak, BLAKE2, and RIPEMD-160 - when SHA-2 does not match.https://ctfpal.com/?tool=sha3-blake-hashes

Reading

Practice set

Real picoCTF challenges tagged with this module’s techniques, easiest first. Assign the first three in class and the rest as homework.

  1. hashcrack - picoCTF 2025, easy
  2. HashingJobApp - Beginner picoMini 2022, easy
  3. PW Crack 1 - Beginner picoMini 2022, easy
  4. PW Crack 2 - Beginner picoMini 2022, easy
  5. hash-only-1 - picoCTF 2025, medium
  6. Hashgate - picoCTF 2026, medium
  7. It is my Birthday - picoCTF 2021, medium
  8. It is my Birthday 2 - picoCTF 2021, medium
  9. PW Crack 3 - Beginner picoMini 2022, medium
  10. PW Crack 4 - Beginner picoMini 2022, medium
  11. PW Crack 5 - Beginner picoMini 2022, medium
  12. Tap into Hash - picoCTF 2025, medium

Checkpoint (gradeable)

Identify an unknown digest, justify the identification, then crack it - or argue from the algorithm why cracking is the wrong path.

Deliberately a produced artefact rather than a quiz question: it is either there or it is not, which makes it fast to mark and hard to bluff. Every tool in ctfpal is deterministic, so two students who did the work correctly hand in the same value.

Where the room gets stuck

The valuable outcome is the negative one: students should leave able to say 'this is bcrypt, so the password is somewhere else in the challenge'. That judgement is worth more than any successful crack.

If you finish early

  • Hand out a challenge from the cross-CTF index in this category - each one has published solutions to compare afterwards.
  • Run the same input through Identify and let the class argue with the ranking. Disagreeing with a confidence score is where the technique actually lands.
  • Ask a student to break their own example - construct an input that defeats the tool, and explain why.