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
|