Reputation
Top tag
Next privilege 150 Rep.
Create new tags
Badges
1 5
Impact
~4k people reached

  • 0 posts edited
  • 0 helpful flags
  • 3 votes cast
Dec
2
awarded  Notable Question
Jun
11
awarded  Popular Question
Aug
14
accepted Common modulus attack on RSA when the 2 public exponents differ by a single bit
Aug
14
comment Common modulus attack on RSA when the 2 public exponents differ by a single bit
thanks! i am clear now!
Aug
14
comment Common modulus attack on RSA when the 2 public exponents differ by a single bit
still didn't get it, say e and e2 can be divided by n, how come e-e2 can be divided by n as well? i can't see the relationship between e-e2 and n...
Aug
14
comment Common modulus attack on RSA when the 2 public exponents differ by a single bit
sorry for my stupid question, why n can be divided by e-e2?, is that a property? or can it prove?
Aug
14
comment Common modulus attack on RSA when the 2 public exponents differ by a single bit
Thanks for your answer , may i know why gcd(e,e2) = gcd(e,e-e2)
Aug
14
asked Common modulus attack on RSA when the 2 public exponents differ by a single bit
Aug
4
awarded  Scholar
Aug
4
awarded  Supporter
Aug
4
accepted How to jusify {e,n} is a valid RSA public key?
Aug
4
comment How to jusify {e,n} is a valid RSA public key?
that's cool! spending some time, finally understand what do you mean, may i have one more follow up, why Euler toient function of N, must be even number?
Aug
2
awarded  Student
Aug
2
comment How to jusify {e,n} is a valid RSA public key?
thx for your answer. i didn't get what this mean "e is relatively prime to ϕ(N)" can you illustrate by a simple example?
Aug
1
asked How to jusify {e,n} is a valid RSA public key?
Aug
1
awarded  Autobiographer