Re: Coppersmith's small root finding for modular polynomials

[Karim Belabas <Karim.Belabas@math.u-bordeaux1.fr>]

* Max Alekseyev [2008-04-26 12:56]:
> On Sat, Apr 26, 2008 at 3:33 AM, Karim Belabas
> <Karim.Belabas@math.u-bordeaux1.fr> wrote:
> > * Max Alekseyev [2008-04-26 11:35]:
> >
> > > I wonder whether Don Coppersmith's method for finding small root of
> >  > modular polynomial is implemented in PARI/GP?
> >
> >  (12:32) gp > ???Coppersmith
> >  zncoppersmith
> >
> >  Is this what you're looking for ?
> 
> That's it! Thanks.
> 
> Actually, I've tried to search it via "??? LLL" in GP and
> "Coppersmith" at the PARI website, but neither search succeeded.
> 
> I think it make sense to list this function as related to LLL as well
> as list the name of Coppersmith explicitly in the documentation, so it
> would be simpler to find this function.

Done in svn:

(13:19) gp > ???LLL
algdep        elllocalred   elllseries    idealred      lindep
mathnf        matkerint     nfgaloisconj  nfinit        qflll
qflllgram     rnflllgram    rnfpolredabs  zncoppersmith

See also:
  Vectors, matrices, linear algebra and sets

(and Coppersmith now appears in the user's manual index)

Thanks,

    K.B.
--
Karim Belabas, IMB (UMR 5251)  Tel: (+33) (0)5 40 00 26 17
Universite Bordeaux 1          Fax: (+33) (0)5 40 00 69 50
351, cours de la Liberation    http://www.math.u-bordeaux.fr/~belabas/
F-33405 Talence (France)       http://pari.math.u-bordeaux.fr/  [PARI/GP]
`