Explanation:
Explanation:
RSA encryption is performed by calculating C=M^e(mod n).
However, if n is much larger than e (as is the case here), and if the message is not too long (i.e. small M), then M^e(mod n) == M^e and therefore M can be found by calculating the e-th root of C.
Answer:
0-9
Explanation:
count 0 as 1
len(0,1,2,3,4,5,6,7,8,9)=10
I believe the answer is B<span />
