Brimstone for cracking RSA. (jk)

[Uncwilly]

Originally Posted by SarK0Y

You lost very point == the task ain't been just solve (it has no sense) == the task is to solve (at least approximate as much as possible) for POLYNOMIAL TIME. can you do it? so, don't feed me numbers == the're a hella lot of them w/o such help

And you earned yourself a timeout. PM me or any supermod with the factorization of the first test to have posting privileges restored.

[Ericmonroe]

I think you should know more about the difference between a factor and multiple.

[Ericmonroe]

I also researched some information about my question and found this answer https://differencebtwn.com/differenc...or-vs-multiple

[SarK0Y]

@Gelly
Always good to see a decent criticism.. well then, let's be clear upon that AMAP

You claimed to "have a milestone" in integer factorization and continue claiming that you will "crack rsa,

First & foremost, we need to look into canonical definition of «MILESTONE»..

2. a significant event or point in development.
https://www.thefreedictionary.com/milestone

it doesn't mean «final point» & definitely it doesn't mean something magic. It just means that project has had some positive/promising results to proceed further. 2nd moment, Polynomial time doesn't mean you can crack everything in no time. For example, O(N*lgN) & O(N²) are both polynomial time, but (w/ growing N) gap between those speeds becomes Abyss.

You then refuse to demonstrate (or even explain!) your method in a significant way

actually, there ain't been questions on-topic.. some guys struggled w/ their deep fears of malware & others just have wanted a magic out of the Blue

but I'm pretty sure you need the exact sum, and not just an approximation,

from the POV of Practice, we need approximation a way down to the point, where it's possible to use brute force for getting exact sum.


Well, this link will answer your questions, if you really want them...
https://alg0z.blogspot.com/2020/12/major-update-fpc15rev3.html

MODERATOR NOTE: Link disabled pending evaluation of software downloads thereat

[mathwiz]

Originally Posted by SarK0Y

actually, there ain't been questions on-topic..

Actually, there have been: "Can you factor this composite to demonstrate your algorithm isn't complete BS?"

[SarK0Y]

Originally Posted by mathwiz

Actually, there have been: "Can you factor this composite to demonstrate your algorithm isn't complete BS?"

say me, please, what do you mean with phrase «complete BS». For now, the're no algorithms of integer factorization for practical use == they're too greedy for memory & cpu + they're bad for concurrency too. And actually I have shared everything about my researching. my goal hasn't been to crack occasional rsa numbers, just been researching possible ways to approximate Z. at the very least, it's curious from the POV of theoretical matter

[Dylan14]

Initial investigation of the file: VirusTotal reports that the URL is clean.
The file that that link takes me is clean, according to VirusTotal.
Attempting to run the program sandboxed in Windows 10 doesn't work (needs the bash shell to work, plus Start.exe fails to start).
Attempting to run it in a Linux VM, gets me this far when I run the first bit of code in the pdf you linked:

./fpc -ver -poweredby -bye
sh: en: command not found
see seed: 682257166327978917907309860240882231625049719486075477905198 bits: 199
Please, enter a coef 4 Z:

Which is not the expected result.
So I thought, maybe I should recompile. Except that doesn't work, as the stuff in the makefile appears to be hardcoded, due to the software used to make the makefile. This of course makes it impossible for one to just download the source and compile, unless they go through the trouble of making the file themselves (which I am not going to do).

[SarK0Y]

Originally Posted by Dylan14

Initial investigation of the file: VirusTotal reports that the URL is clean.
The file that that link takes me is clean, according to VirusTotal.
Attempting to run the program sandboxed in Windows 10 doesn't work (needs the bash shell to work, plus Start.exe fails to start).
Attempting to run it in a Linux VM, gets me this far when I run the first bit of code in the pdf you linked:

./fpc -ver -poweredby -bye
sh: en: command not found
see seed: 682257166327978917907309860240882231625049719486075477905198 bits: 199
Please, enter a coef 4 Z:

Which is not the expected result.
So I thought, maybe I should recompile. Except that doesn't work, as the stuff in the makefile appears to be hardcoded, due to the software used to make the makefile. This of course makes it impossible for one to just download the source and compile, unless they go through the trouble of making the file themselves (which I am not going to do).

what is version you downloaded? actually, i use codelite to edit sources & build 'em.


P.S.

sh: en: command not found

my bad :) in the main.cpp

system("TZ='Europe/Moscow' en date");

delete it or change to..

system("date");

[Dylan14]

Originally Posted by SarK0Y

what is version you downloaded? actually, i use codelite to edit sources & build 'em.

Rev 3, the latest one in this thread (ie the one where the hyperlink is disabled due to potential malware risk).

[SarK0Y]

Originally Posted by Dylan14

Rev 3, the latest one in this thread (ie the one where the hyperlink is disabled due to potential malware risk).

what is funny sourceforge has shown no downloads and all archives are healthy (except directory for encrypted ones).

[SarK0Y]

https: //sourceforge.net/projects/fastprimecruncher/files/Build/FPC15/build.sh/download
this script builds stuff...
[QUOTEmkdir ./Debug
export compiler=$1
$compiler -c "./main.cpp" -g -g3 -O0 -pedantic -Wall -std=gnu++20 -o ./Debug/main.cpp.o -I$2/include -I.
$compiler -c "./gears.cpp" -g -g3 -O0 -pedantic -Wall -std=gnu++20 -o ./Debug/gears.cpp.o -I$2/include -I.
$compiler -c "./vars.cpp" -g -g3 -O0 -pedantic -Wall -std=gnu++20 -o ./Debug/vars.cpp.o -I$2/include -I.
$compiler -c "./S0T.cpp" -g -g3 -O0 -pedantic -Wall -std=gnu++20 -o ./Debug/S0T.cpp.o -I$2/include -I.
$compiler -c "./alt_funcs.cpp" -g -g3 -O0 -pedantic -Wall -std=gnu++20 -o ./Debug/alt_funcs.cpp.o -I$2/include -I.
$compiler -c "./taltws.cpp" -g -g3 -O0 -pedantic -Wall -std=gnu++20 -o ./Debug/taltws.cpp.o -I$2/include -I.
$compiler -c "./S0T_v0.cpp" -g -g3 -O0 -pedantic -Wall -std=gnu++20 -o ./Debug/S0T_v0.cpp.o -I$2/include -I.
$compiler -c "./gears2.cpp" -g -g3 -O0 -pedantic -Wall -std=gnu++20 -o ./Debug/gears2.cpp.o -I$2/include -I.
$compiler -o ./Debug/FastPrimeCruncher @"FastPrimeCruncher.txt" -L. -L$2/lib64 -g -lgmp -lpthread
chmod u+x ./Debug/FastPrimeCruncher
echo "path to program is ./Debug/FastPrimeCruncher"[/QUOTE]just put it into project's directory, then chmod u+x ./build.sh & run ./build.sh /path/to/g++ /dir/of/gcc Ex. ./build.sh /gcc10/bin/g++ /gcc10