mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Factoring

Reply
 
Thread Tools
Old 2022-01-19, 17:03   #12
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

529310 Posts
Default

If you can run linux, use cado-nfs. Everything is automated, you simply invoke "cado-nfs.py {input number}" and wait / watch. The job will run faster if you first fetch the updated parameters files from the Cado-nfs forum here. I recommend 16GB ram if you use CADO for your desired factorization; 8GB might work, but might not be enough.

If all you have is windows, YAFU is the way to go- it controls msieve and ggnfs to manage the entire job too.

Whatever you use, run a small job like 100-110 digits first, to learn what is supposed to happen. It'll take maybe an hour, depending on how fast your machine is. Time to factor doubles every 5-5.5 digits, so a C154 will take about 4x as long as a C143; around 70 times longer than a C120. I'd run a second job in the 120-130 digit range before I tried C150+.
VBCurtis is offline   Reply With Quote
Old 2022-01-19, 17:36   #13
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Liverpool (GMT/BST)

598510 Posts
Default

If you have windows it is possible to get CADO working on WSL2 although this requires fixing a few broken links.
henryzz is offline   Reply With Quote
Old 2022-01-19, 17:55   #14
Stargate38
 
Stargate38's Avatar
 
"Daniel Jackson"
May 2011
14285714285714285714

26·11 Posts
Default

Once you factor the number, could you please publish the factors? I'm curious as to which number it is.
Stargate38 is offline   Reply With Quote
Old 2022-01-19, 18:21   #15
xilman
Bamboozled!
 
xilman's Avatar
 
"๐’‰บ๐’ŒŒ๐’‡ท๐’†ท๐’€ญ"
May 2003
Down not across

132·67 Posts
Default

Quote:
Originally Posted by Lessiv View Post
I do not hide my identity, it's like a race - a game, who will understand one software mechanism faster.
It is just necessary that this number is NOT in the public domain, so that other participants do not use it
Fair enough. In that case I will not offer to factor it for you. It would not be fair on the other competitors.

Good luck!
xilman is offline   Reply With Quote
Old 2022-01-19, 18:39   #16
firejuggler
 
firejuggler's Avatar
 
"Vincent"
Apr 2010
Over the rainbow

2,843 Posts
Default

And are you sure it is a product of only 2 factors? cause you know.. if it is not it can ( low prob) be factored by ECM.
firejuggler is offline   Reply With Quote
Old 2022-01-20, 11:51   #17
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
"name field"
Jun 2011
Thailand

35×41 Posts
Default

Quote:
Originally Posted by Lessiv View Post
Sorry, but here I do not understand - why should I waste precious time. Of course, I will run a small number, just to check that everything is set up as it should and then skip the factoring of the Real number.
To get the feeling of how it goes, and to learn something in the process. And to gain the patience... For example my computer(s), anything between 6 cores and 18 cores, can factor a 100 digits number in minutes, but the time doubles with every 4-5-6 digits, depending on the number and on the system. So, a 154 digits can take anything between few days and few weeks.
LaurV is offline   Reply With Quote
Old 2022-01-20, 15:12   #18
bur
 
bur's Avatar
 
Aug 2020
79*6581e-4;3*2539e-3

503 Posts
Default

If you use yafu, make sure it will not attempt ECM! As already mentioned it's useless for your number since there will be no small factors. You can do that by invoking yafu factor(12345) -noecm -threads n where n is the number of threads.
bur is offline   Reply With Quote
Old 2022-01-20, 17:06   #19
Stargate38
 
Stargate38's Avatar
 
"Daniel Jackson"
May 2011
14285714285714285714

26·11 Posts
Default

You can also do "yafu nfs(number) -threads n".

Last fiddled with by Stargate38 on 2022-01-20 at 17:06 Reason: forgot period
Stargate38 is offline   Reply With Quote
Old 2022-01-20, 17:41   #20
retina
Undefined
 
retina's Avatar
 
"The unspeakable one"
Jun 2006
My evil lair

2·32·359 Posts
Default

The suggestion to practice on smaller numbers first is very good. No sense in wasting weeks on a large number only to discover your configuration is wrong and it fails.

Here are some numbers you can use to practice:
https://en.wikipedia.org/wiki/RSA_numbers
retina is online now   Reply With Quote
Old 2022-01-21, 16:12   #21
Lessiv
 
Jan 2022

100112 Posts
Default

I ran msieve and ggnfs and looked for 100 digit number
My computer (i9) found it in 12 minutes.
I have a question: how to run along with the processor and CUDA?
I think it will be even faster.

Last fiddled with by Lessiv on 2022-01-21 at 16:13
Lessiv is offline   Reply With Quote
Old 2022-01-21, 16:40   #22
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

67×79 Posts
Default

Only the first step (polynomial selection) is cuda-enabled.
If you use a version of msieve compiled for CUDA, it will automatically use the GPU for that step.
VBCurtis is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Breakthrough in Very Large Integer factorization? jpcu1237 Tales From the Crypt(o) 18 2020-07-16 22:23
Methods of attacking a large factorization CRGreathouse Factoring 55 2014-04-11 15:05
An equivalent problem for factorization of large numbers HellGauss Math 5 2012-04-12 14:01
Fermat numbers factorization ET_ Factoring 15 2008-03-12 21:24
How do I get LARGE numbers Bundu Software 5 2004-08-26 01:56

All times are UTC. The time now is 06:26.


Sun May 29 06:26:22 UTC 2022 up 45 days, 4:27, 0 users, load averages: 1.47, 1.34, 1.35

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

โ‰  ยฑ โˆ“ รท ร— ยท โˆ’ โˆš โ€ฐ โŠ— โŠ• โŠ– โŠ˜ โŠ™ โ‰ค โ‰ฅ โ‰ฆ โ‰ง โ‰จ โ‰ฉ โ‰บ โ‰ป โ‰ผ โ‰ฝ โŠ โŠ โŠ‘ โŠ’ ยฒ ยณ ยฐ
โˆ  โˆŸ ยฐ โ‰… ~ โ€– โŸ‚ โซ›
โ‰ก โ‰œ โ‰ˆ โˆ โˆž โ‰ช โ‰ซ โŒŠโŒ‹ โŒˆโŒ‰ โˆ˜ โˆ โˆ โˆ‘ โˆง โˆจ โˆฉ โˆช โจ€ โŠ• โŠ— ๐–• ๐–– ๐–— โŠฒ โŠณ
โˆ… โˆ– โˆ โ†ฆ โ†ฃ โˆฉ โˆช โŠ† โŠ‚ โŠ„ โŠŠ โŠ‡ โŠƒ โŠ… โŠ‹ โŠ– โˆˆ โˆ‰ โˆ‹ โˆŒ โ„• โ„ค โ„š โ„ โ„‚ โ„ต โ„ถ โ„ท โ„ธ ๐“Ÿ
ยฌ โˆจ โˆง โŠ• โ†’ โ† โ‡’ โ‡ โ‡” โˆ€ โˆƒ โˆ„ โˆด โˆต โŠค โŠฅ โŠข โŠจ โซค โŠฃ โ€ฆ โ‹ฏ โ‹ฎ โ‹ฐ โ‹ฑ
โˆซ โˆฌ โˆญ โˆฎ โˆฏ โˆฐ โˆ‡ โˆ† ฮด โˆ‚ โ„ฑ โ„’ โ„“
๐›ข๐›ผ ๐›ฃ๐›ฝ ๐›ค๐›พ ๐›ฅ๐›ฟ ๐›ฆ๐œ€๐œ– ๐›ง๐œ ๐›จ๐œ‚ ๐›ฉ๐œƒ๐œ— ๐›ช๐œ„ ๐›ซ๐œ… ๐›ฌ๐œ† ๐›ญ๐œ‡ ๐›ฎ๐œˆ ๐›ฏ๐œ‰ ๐›ฐ๐œŠ ๐›ฑ๐œ‹ ๐›ฒ๐œŒ ๐›ด๐œŽ๐œ ๐›ต๐œ ๐›ถ๐œ ๐›ท๐œ™๐œ‘ ๐›ธ๐œ’ ๐›น๐œ“ ๐›บ๐œ”