# Tag Info

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 ...