network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 5 months |
| seen | Dec 7 '12 at 13:37 | |
| stats | profile views | 0 |
|
Dec 7 |
comment |
Factorize RSA knowing several N and E i hit enter accidentally, this isnt solved. I meant to say "i got the numbers used in the contest" ;) edited above post. |
|
Dec 7 |
comment |
Factorize RSA knowing several N and E alroight, i got the numbers. So i did gcd(n1,n2) and got some huge number R, not 1. Is that a good thing? i did n1 / R and got some result R2. Checked R*R2 == n1 and yes, that`s the case. <is that a good thing? Would i not have to check for R and R2 being primes? which would take ages, as these are 2048 bit exponents... |
|
Dec 7 |
comment |
Factorize RSA knowing several N and E possible. I asked the host for the numbers again, he ll send them to me, but i am not supposed to share them in public as they are being reused. Anyways, how would the gcd() of two moduli help me? |
|
Dec 7 |
comment |
Factorize RSA knowing several N and E i dont think so, only N and E like this: 10001 <...N1...> 10001 <...N2...> 10001 <...N3...> |
