Link your SSH key, then connect with: ssh hacker@dojo.pwn.college
Decode Base32-encoded data
Connect with SSH
Link your SSH key, then connect with: ssh hacker@dojo.pwn.college
Decrypt a secret encrypted with a one-time pad, assuming a securely transferred key
Connect with SSH
Link your SSH key, then connect with: ssh hacker@dojo.pwn.college
Decrypt a secret encrypted with a one-time pad, where the key is reused for arbitrary data
Connect with SSH
Link your SSH key, then connect with: ssh hacker@dojo.pwn.college
Decrypt a secret encrypted with AES using the ECB mode of operation
Connect with SSH
Link your SSH key, then connect with: ssh hacker@dojo.pwn.college
Decrypt a secret encrypted with AES-ECB, where arbitrary data is appended to the secret and the key is reused
Connect with SSH
Link your SSH key, then connect with: ssh hacker@dojo.pwn.college
Decrypt an RSA-encrypted secret using provided public and private keys
Connect with SSH
Link your SSH key, then connect with: ssh hacker@dojo.pwn.college
Decrypt an RSA-encrypted secret using the provided prime factors of n
Connect with SSH
Link your SSH key, then connect with: ssh hacker@dojo.pwn.college
Find a small hash collision using SHA256, considering only the first 2 bytes
Connect with SSH
Link your SSH key, then connect with: ssh hacker@dojo.pwn.college
Compute a small proof-of-work by appending response data to the challenge data, resulting in a SHA256 hash with 3 leading null-bytes.
Connect with SSH
Link your SSH key, then connect with: ssh hacker@dojo.pwn.college
MD4 is not secure! In this challenge, you will build an MD4 collision of a given random string.
You are strongly recommended to find an MD4 collision generator on the Internet or GitHub.
You are not encouraged to implement the algorithm by yourself.
Connect with SSH
Link your SSH key, then connect with: ssh hacker@dojo.pwn.college
MD5 is not secure!
In this challenge, you will build an MD5 collision of two given PNG files.
You are given pic1.png and pic2.png.
Your goal is creating two files, f1.png and f2.png, that satisfy the following requirements:
pic1.png and f1.png look the same (have the same pixels at corresponding coordinates).
pic2.png and f2.png look the same (have the same pixels at corresponding coordinates).
MD5(f1.png) == MD5(f2.png)
You are strongly recommended to find an MD5 collision generator on the Internet or GitHub.
You are not encouraged to implement the algorithm by yourself.
Connect with SSH
Link your SSH key, then connect with: ssh hacker@dojo.pwn.college
This challenge demonstrates the low-exponent attack against textbook RSA.
In the textbook implementation of RSA (when no padding is used), choosing an exponent that is sufficiently high is critical.
Alice chose e = 3 and encrypted a flag.
Please decrypt the message and obtain your flag.
Connect with SSH
Link your SSH key, then connect with: ssh hacker@dojo.pwn.college
This challenge demonstrates insecure Ns in RSA.
Factoring a large number N (where N = p * q, both p and q are prime numbers) is extremely difficult.
However, the difficulty level is significantly reduced if p and q are too close to each other.
Alice chose p and q that are too close.
Please decrypt her RSA-encrypted message and obtain your flag.
Connect with SSH
Link your SSH key, then connect with: ssh hacker@dojo.pwn.college
30-Day Scoreboard:
This scoreboard reflects solves for challenges in this module after the module launched in this dojo.