Commit cf20999e authored by Keita Xagawa's avatar Keita Xagawa
Browse files


parent 51cb6248
Problem 1
Problem 1: Too short
We have C = M^e mod N
We have C = M^e mod N, where M is at most 256 bits and N is 1024 bits.
1. Find M = C^d mod N
2. Print m = unhexlify(hex(int(M)).strip('0xL'))
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment