Hi all, I am focusing on the LLL algorithm for my PhD. Specifically, on its application on Factorising RSA modulus N with high or low-order bits (of the prime p) known. My scope is to use an implementation and run tests on the factorisation problem.
SAGE has embedded Stehle's LLL version: the fplll. But, I have not found any module on SAGE for factorising an RSA modulus with high or low-order bits known (there is a module called SmallRoots on MAGMA, but it is not practical). So - given that SAGE contains a lot of related modules in this area - my question is whether there is plan to create such a module in SAGE, or if there is some alternative solution for the RSA factorisation problem Thank you. -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
