On Apr 26, 11:57 am, "John Cremona" <[EMAIL PROTECTED]> wrote:
Hi John,
> Am I right in thinking that this is in Sage?
Yes, I saw the email on the pari user's list and thought the same
thing. IIRC this was implemented by Martin Albrecht in Sage 2.11:
* Small roots method for polynomials mod N (N composite): Martin
Albrecht implemented Coppersmith's method for finding small roots
of univariate polynomials modulo N where N is composite.
More info on #2424. I figure it is best if you answer the email on the
pari user's list.
Cheers,
Michael
> John
>
> ---------- Forwarded message ----------
> From: Max Alekseyev <[EMAIL PROTECTED]>
> Date: 2008/4/26
> Subject: Coppersmith's small root finding for modular polynomials
> To: pari-users <[EMAIL PROTECTED]>
>
> Hello!
>
> I wonder whether Don Coppersmith's method for finding small root of
> modular polynomial is implemented in PARI/GP?
> If not, is there any third party implementations available?
>
> Thanks,
> Max
--~--~---------~--~----~------------~-------~--~----~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/sage-devel
URLs: http://www.sagemath.org
-~----------~----~----~----~------~----~------~--~---
