cryptoProeasy

Основы RSA 1 (RSA Basics 1)

hackerlab

Task: RSA-encrypted message with public key (n, e) and one prime factor p provided as extra data. Solution: Calculate q from n/p, compute private exponent d using modular inverse, decrypt ciphertext.

$ ls tags/ techniques/
modular_inversersaknown_prime_factorasymmetric_encryptionprivate_key_recovery
Integer to bytes conversionRSA decryption with known prime factorModular inverse calculation for private exponent
🔒

Permission denied (requires tier.pro)

Sign in to access full writeups

Sign in with GitHub to continue. No email required.

$sign in

$ grep --similar

Similar writeups