Reputation
Next privilege 150 Rep.
Create new tags
Badges
5
Newest
 Scholar
Impact
~208 people reached

Dec
23
awarded  Scholar
Dec
23
accepted Solve a Modular Exponentiation
Dec
23
revised Solve a Modular Exponentiation
equation question
Dec
23
comment Solve a Modular Exponentiation
Thank you very much for your reply but why can we reform the equation like: $m=s^e$ mod $n$ => $m+k*n=s^e$ => $s=(m+k*n)^{1/e}$ and start trying different k, as long as, we just want to find an s satisfying this equation? Thank you for the detailed explanation.
Dec
21
awarded  Student
Dec
21
revised Solve a Modular Exponentiation
Tags added
Dec
21
revised Solve a Modular Exponentiation
GNFS addition
Dec
21
comment Solve a Modular Exponentiation
yes we can assume it is RSA
Dec
21
revised Solve a Modular Exponentiation
spelling mistake
Dec
21
asked Solve a Modular Exponentiation
Dec
19
awarded  Supporter
Dec
18
revised RSA Signature Weak Padding Attack
updated case
Dec
18
suggested approved edit on RSA Signature Weak Padding Attack
Dec
18
awarded  Editor
Dec
18
revised RSA Signature Weak Padding Attack
More details
Dec
18
suggested approved edit on RSA Signature Weak Padding Attack
Oct
24
awarded  Autobiographer