|
2017-12-11, 13:59
|
#1 |
|
Dec 2017
2 Posts |
Base method of montgomery polyselect implementation
Hi there,
I am in need of some help regarding implementing the base method of Montgomery's basic (quadratic) polynomial selection. I saw that Chris Monico has written some code about it in GGNFS but still, can't find/distinguish that part. Guess if there's other alternative? Thank you anyway |
|
|
|
2017-12-12, 19:47
|
#2 |
|
Just call me Henry
"David"
Sep 2007
Liverpool (GMT/BST)
10111111100012 Posts |
I think I based my implementation on http://www.mersennewiki.org/index.ph...uadratic_sieve
|
|
|
|
2017-12-13, 07:04
|
#3 |
|
Dec 2017
2 Posts |
kinda plan to use it on GNFS actually
so, i plan to use this basic quadratics method of montgomery and use the theoretical generalisation too build the cubic polynomials to implement and test on NFS sieving. did you know where to get some "basic" implementation of montgomery?
|
|
|
|
 |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Playing with CADO's individual polyselect binaries | Dubslow | CADO-NFS | 22 | 2016-07-04 19:54 |
| To CPU or to GPU: stage1 polyselect research | Karl M Johnson | Msieve | 8 | 2011-11-12 19:46 |
| Quadratic sieve method implementation.. | abhiiitkgp | Homework Help | 4 | 2011-10-31 13:22 |
| Montgomery method in Prime Numbers: ACP | SPWorley | Math | 5 | 2009-08-18 17:27 |
| Montgomery Multiplication | dave_dm | Math | 2 | 2004-12-24 11:00 |
