|
Max Alekseyev on Sat, 26 Apr 2008 11:35:19 +0200
|
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
|
Coppersmith's small root finding for modular polynomials
|
- To: pari-users <pari-users@list.cr.yp.to>
- Subject: Coppersmith's small root finding for modular polynomials
- From: "Max Alekseyev" <maxale@gmail.com>
- Date: Sat, 26 Apr 2008 02:33:31 -0700
- Delivery-date: Sat, 26 Apr 2008 11:35:19 +0200
- Dkim-signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=gamma; h=domainkey-signature:received:received:message-id:date:from:to:subject:mime-version:content-type:content-transfer-encoding:content-disposition; bh=7TTEFer2P3WU9ifH+GO1D0PAahK42hYmsh0HaTn8gWI=; b=PW7fZrthPTEXy0N7NlIs5KQQpvXlQtUcw1pZac3VcJBNxb2YVAxLAt3vrDc+t5VY3GgTd4l19to97mmTnN6cA/Z697y0iVUu332gIBPCTtbswtxTwS3fzY1V+tn23CR2ERR+2WWte6lpQq42SWI6NxLxJQEottDW/D+frR0+S4E=
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=message-id:date:from:to:subject:mime-version:content-type:content-transfer-encoding:content-disposition; b=sLbjRg1zfDy5rSBBoKbaWTKN4IEVQE82zK7zxINGQvHXv+0T6hIgEPQjkLmM1ril0nnltEMm13DrAiAJnWjJox80bAP/xgWD5Nd/g/JRUr/ij8hl5DzZFvLGj6iD1pqaxrW18iRPspu+8B4/7RQRamk0VX3P59DITgB4+Knv7r0=
- Mailing-list: contact pari-users-help@list.cr.yp.to; run by ezmlm
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