Clear it in 3 steps
-
No environment needed
This challenge can be solved with the information in the statement alone. Submit the flag you find directly.
-
Investigate the target
-
Submit the flag
Factor a tiny RSA modulus, recover the private exponent, and decrypt a list of ciphertext values. Public key and ciphertexts: n = 323 e = 5 ciphertexts = [115, 181, 241, 109, 109, 57, 190, 115, 241, 57, 65, 271, 49, 115, 57, 241, 190, 271, 57, 85, 271, 241, 65] Factor n to recover the private exponent d and decrypt each value. Wrap the decrypted string in KINOCO{...} to form the flag.
This challenge can be solved with the information in the statement alone. Submit the flag you find directly.
n is 17 x 19
d is the modular inverse of e modulo phi(n)
Concatenate chr(pow(c, d, n)) for every c