New answers tagged

0

Recently I saw a article for factoring RSA module. Authors of this article introduce a lattice base method where Coppersmith method is a special case of it. With this method we can factor RSA modules with weak prime factor in polynomial time. Also I implemented it in MAGMA and such $2048$-bit modules factored in second. For more detail you can see ...


1

I'm answering the questions I posed. While cygnusv answer was correct for the idea I presented, it was not helpful to me as I had already identified and solved that issue, but failed to present the correct algorithm in my question. I'm not saying cygnusv is wrong; the answers presented are very much correct and I gave a +1. However, there were more questions ...



Top 50 recent answers are included