Timeline for Possibility of factorisation of rsa modulus due to vulnerability in java implementation code
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 28, 2016 at 23:11 | history | edited | Mike Edward Moras | edited tags | |
| Mar 5, 2013 at 17:09 | review | First posts | |||
| Mar 6, 2013 at 21:36 | |||||
| Mar 5, 2013 at 17:02 | answer | added | poncho♦ | timeline score: 5 | |
| Mar 5, 2013 at 17:02 | comment | added | mikeazo | Your method of choosing $d$ and then computing $e$ is nonstandard and probably could lead to breaks. At the very least, it is inefficient. Often we simply fix $e=65567$, make sure it is coprime to $\varphi(n)$, then compute $d$. | |
| Mar 5, 2013 at 17:00 | comment | added | mikeazo | This site is not for code review. For that, I'd suggest CodeReview.SE. That said, the crypto expertise here will probably be of more help. So instead of simply pasting your code here, rewrite it into mathematical equations. That would be more on-topic here. | |
| Mar 5, 2013 at 16:49 | history | asked | neel | CC BY-SA 3.0 |