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

I think I based my implementation on [url]http://www.mersennewiki.org/index.php/Multiple_polynomial_quadratic_sieve[/url]

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?:smile: