John
---------- Forwarded message ----------
From: Max Alekseyev <max...@gmail.com>
Date: 2008/4/26
Subject: Coppersmith's small root finding for modular polynomials
To: pari-users <pari-...@list.cr.yp.to>
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
I decided that was unnecessary as the question had already been
answered positively (gp has a function zncoppersmith which does this).
John
Just for the archives: Yes, it is in Sage too:
http://trac.sagemath.org/sage_trac/ticket/2424
But as Pari has it too it seems we could just call that and be done.
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_www: http://www.informatik.uni-bremen.de/~malb
_jab: martinr...@jabber.ccc.de