network profile
| bio | website | karelbilek.com |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 6 months |
| seen | Oct 28 '12 at 3:56 | |
| stats | profile views | 0 |
(your about me is currently blank)
|
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. |
