Basic Mathematics


Cryptomania.

This module will teach you the mathematical foundations that power many cryptographic algorithms.

These concepts are crucial for understanding RSA encryption, Diffie-Hellman key exchange, and many other cryptographic protocols.



Challenges

This challenge introduces you to the concept of "clock arithmetic" and how numbers wrap around in modular systems.

Connect with SSH

Link your SSH key, then connect with: ssh hacker@pwn.college

Learn how to find numbers that "undo" multiplication in modular systems using the Extended Euclidean Algorithm. This concept is essential for RSA decryption and many other cryptographic operations.

Connect with SSH

Link your SSH key, then connect with: ssh hacker@pwn.college

Learn how to solve systems of modular equations - a technique that speeds up computations in RSA and other cryptographic systems by breaking large problems into smaller, manageable pieces.

Connect with SSH

Link your SSH key, then connect with: ssh hacker@pwn.college

Fermat's Little Theorem - a beautiful result that reveals patterns in modular exponentiation! This theorem is the mathematical foundation behind RSA encryption and helps us compute large powers efficiently in cryptographic applications.

Connect with SSH

Link your SSH key, then connect with: ssh hacker@pwn.college

Apply all you learned!

Connect with SSH

Link your SSH key, then connect with: ssh hacker@pwn.college

30-Day Scoreboard:

This scoreboard reflects solves for challenges in this module after the module launched in this dojo.

7-Day | 30-Day | All-Time

Rank Hacker Badges Score