cryptomedium
Алиса не знает алгебру (Alice doesn't know algebra)
hackerlab
Task: RSA service encrypts a secret key with two different prime exponents under the same modulus N, providing both ciphertexts. Solution: Classic RSA Common Modulus Attack using Extended Euclidean Algorithm to find Bézout coefficients and recover plaintext from two ciphertexts.
$ ls tags/ techniques/
extended_euclidean_algorithmrsa_common_modulus_attackmodular_inverse_for_negative_exponents
🔒
Permission denied (requires tier.pro)
Sign in to access full writeups
Create a free account with GitHub to get started.
$ssh [email protected]