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 fpl
This is really helpful Martin!
Thank you very much.
I shall have a thorough look at this.
And I would be very happy to contribute too.
Regards,
Ermis
On Jan 29, 8:41 pm, Martin Albrecht
wrote:
> On Sunday 29 January 2012, Ermis wrote:
>
> > Hi all,
>
> Hi,
>
> &g
Hi Bill,
I will have a look at this p^2+p+1 algorithm.
I haven't tried flint to be honest. This might be an alternative
solution.
Thank you very much!
Regards,
Ermis
On Jan 29, 9:55 pm, Bill Hart wrote:
> There's an LLL in flint 1.5, called ULLL which is very fast for large
>
