cryptoProeasy
Bread 1 — RSA Decryption
spbctf
Task: Given RSA parameters n, d, c. Solution: Standard RSA decryption using m = pow(c, d, n) since private exponent is already provided.
🔒
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
- [crypto][Pro]Bread 2— spbctf
- [crypto][Pro]Leaked d— uoftctf2026
- [crypto][Pro]Основы RSA 1 (RSA Basics 1)— hackerlab
- [crypto][Pro]ChristmasRSA— grodno_new_year_2026
- [crypto][Pro]weird modulus— spbctf