mersenneforum.org  

Go Back   mersenneforum.org > New To GIMPS? Start Here! > Homework Help

Reply
 
Thread Tools
Old 2017-12-11, 13:59   #1
csg
 
Dec 2017

102 Posts
Smile 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
csg is offline   Reply With Quote
Old 2017-12-12, 19:47   #2
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

34·71 Posts
Default

I think I based my implementation on http://www.mersennewiki.org/index.ph...uadratic_sieve
henryzz is offline   Reply With Quote
Old 2017-12-13, 07:04   #3
csg
 
Dec 2017

2 Posts
Default 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?
csg is offline   Reply With Quote
Reply

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

All times are UTC. The time now is 18:40.

Tue Dec 1 18:40:51 UTC 2020 up 82 days, 15:51, 2 users, load averages: 2.29, 2.43, 2.28

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.