mersenneforum.org  

Go Back   mersenneforum.org > Search Forums
Reload this Page Search Results
Register FAQ Today's Posts Search

Showing results 1 to 5 of 5
Search took 0.01 seconds. Search: Posts Made By: Eulero
Forum: Factoring 2010-04-18, 09:10
Replies: 10
Views: 1,492
Posted By Eulero
Mnay thanks for this news, very good. I can have...

Mnay thanks for this news, very good. I can have access to huge Intel and Nvidia resources for testing purposes, so I could have the chance to test if at least polynomial slection could be...
Forum: Factoring 2010-04-18, 07:41
Replies: 10
Views: 1,492
Posted By Eulero
Factoring the RSA-768 as well the RSA-1024 is...

Factoring the RSA-768 as well the RSA-1024 is useless to me, my real aim is to see if the newest CPUs and GPUs can make a work which could have only been possible with computer clusters up to the...
Forum: Factoring 2010-04-17, 20:01
Replies: 10
Views: 1,492
Posted By Eulero
Many thanks, I made a mistake, the limit wasn't...

Many thanks, I made a mistake, the limit wasn't set to 100 digits.

Yes, I knew the steps could be made separately.The msieve limit is 200 digits, very close to 232 but not enough. Are there...
Forum: Factoring 2010-04-17, 18:42
Replies: 10
Views: 1,492
Posted By Eulero
Which kind of tools can be used? Are there...

Which kind of tools can be used? Are there professional tools?
Forum: Factoring 2010-04-17, 14:34
Replies: 10
Views: 1,492
Posted By Eulero
RSA-768 factoring algorythm

I read the article about RSA-768 http://eprint.iacr.org/2010/006.pdf

I would like to know if it's possible to implement such an algorythm for windows taking advantage of newest Intel i480x CPUs...
Showing results 1 to 5 of 5

 
All times are UTC. The time now is 15:39.


Fri Aug 6 15:39:56 UTC 2021 up 14 days, 10:08, 1 user, load averages: 2.49, 2.57, 2.70

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.