Reputation
Top tag
Next privilege 250 Rep.
View close votes
Badges
7
Impact
~1k people reached

  • 0 posts edited
  • 0 helpful flags
  • 12 votes cast
Jan
10
awarded  Popular Question
Nov
28
accepted How can there be AES-256-GCM, when GCM is defined for 128-sized blocks?
Nov
28
asked How can there be AES-256-GCM, when GCM is defined for 128-sized blocks?
Apr
20
awarded  Autobiographer
Jul
4
awarded  Teacher
Jul
2
awarded  Editor
Oct
27
awarded  Student
Oct
27
awarded  Scholar
Oct
27
accepted Why do we need in RSA the modulus to be product of 2 primes?
Oct
27
comment Why do we need in RSA the modulus to be product of 2 primes?
Oh.... so because the attacker would know $\phi(N)$, he would be able to deduce $d$ from $e$ because $de=1$ in mod $\phi(N)$. I think I am starting to get it.
Oct
27
awarded  Supporter
Oct
27
asked Why do we need in RSA the modulus to be product of 2 primes?