So I was trying to factor this really big number (~150 digits), and I read about a factorization method called Number Field Sieve, and a sort of program called msieve in sourceforge that implements the method. Thing is, I'm not really good at computers, and I know this might sound really stupid to some of you, but how does one put the program together?
I went as far as decompressing the file, then I don't know what to do... I was expecting an executable file with a nice GUI desu...
sourceforge dot net / projects / msieve /
all help appreciated and thanks in advance!
I'm on mobile right now so I cant look at the tar to confirm, but it seems like it's a c++ program with what's called a makefile. This makefile is usable by c++ compilers to put together the final program. Find a suitable compiler for the job (GNU Make is the go-to) and use that to "make" the program.
Yes, in fact, slightly more so than on windows thanks to osx being UNIX based. Install the XCode developer tools, and then use the osx terminal, navigate to the extracted folder, and run make.
I actually saved it from tumblr to found out! Sorry!
Thank you so much! So do I just type run make into the terminal after I navigate to the folder? I'm sorry, I'm so much better at math than at computers kek
do you have a processor over a pentium 3?
you can factor that number with a basic java program you probably wrote in your first year at uni, but with memory extensions. it will probably take an hour of programing and 2 of computation.
if you want to factor big numbers make programs that do it. you probably already have starter programs in your college files.
I have an Intel Core M and unfortunately I'm a first year physics major, with few to no knowledge in computer programming / science
I found this java applet that uses another factorization method, but I didn't write it
alpertron dot com dot ar/ ECM dot HTM
150 digits is just beyond what is easily doable for strong RSA semiprimes. I don't know of any programs that will take care of it for you in a reasonable amount of time, especially with no programming experience.
You're basically seeking two 250 bit primes, which is possible, but definitely not trivial.
For RSA? It's possible, yes, but highly, highly unlikely. We've known since the beginning that using composite factors would weaken the security modulus considerably, if it was composite it would require extra checks to make sure everything is still relatively prime making it actually more complicated, and we've known good primality tests for ages now so it's not like it's a huge deal to enforce.