cryptoeasy
BabyEncryption
hackthebox
Task: Decrypt a message encrypted with an affine cipher (ct = 123*pt + 18 mod 256). Solution: Find the modular inverse of 123 mod 256 using the Extended Euclidean Algorithm and reverse the transformation.
$ ls tags/ techniques/
affine_cipher_cryptanalysisextended_euclidean_algorithm
🔒
Permission denied (requires tier.pro)
Sign in to access full writeups
Create a free account with GitHub, then upgrade to Pro.
$ssh [email protected]