Re: Coppersmith's small root finding for modular polynomials

Karim Belabas on Sat, 26 Apr 2008 12:35:17 +0200

[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

Re: Coppersmith's small root finding for modular polynomials

To: pari-users <pari-users@list.cr.yp.to>
Subject: Re: Coppersmith's small root finding for modular polynomials
From: Karim Belabas <Karim.Belabas@math.u-bordeaux1.fr>
Date: Sat, 26 Apr 2008 12:33:57 +0200
Delivery-date: Sat, 26 Apr 2008 12:35:17 +0200
In-reply-to: <d3dac270804260233ted9877cx1f868f39a59c2868@mail.gmail.com>
Mail-followup-to: pari-users <pari-users@list.cr.yp.to>
Mailing-list: contact pari-users-help@list.cr.yp.to; run by ezmlm
References: <d3dac270804260233ted9877cx1f868f39a59c2868@mail.gmail.com>
User-agent: Mutt/1.5.17+20080114 (2008-01-14)

* 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 ?

    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]
`

Follow-Ups:
- Re: Coppersmith's small root finding for modular polynomials
  - From: "Max Alekseyev" <maxale@gmail.com>

References:
- Coppersmith's small root finding for modular polynomials
  - From: "Max Alekseyev" <maxale@gmail.com>

Prev by Date: Coppersmith's small root finding for modular polynomials
Next by Date: Re: Coppersmith's small root finding for modular polynomials
Previous by thread: Coppersmith's small root finding for modular polynomials
Next by thread: Re: Coppersmith's small root finding for modular polynomials
Index(es):
- Date
- Thread