GMP and Windows
-
I would like to use a "Big Number" package for my application which I am writing on Windows using Visual Studio and C++. Therefore, I thought I would use GMP. However, I get the impression that compiling it under Windows is going to be a big job. Therefore, I am wondering if it is worth doing. Could somebody suggest a different package that is more geared towards the windows environment? Thanks Bob
-
I would like to use a "Big Number" package for my application which I am writing on Windows using Visual Studio and C++. Therefore, I thought I would use GMP. However, I get the impression that compiling it under Windows is going to be a big job. Therefore, I am wondering if it is worth doing. Could somebody suggest a different package that is more geared towards the windows environment? Thanks Bob
Depending on what you need libtommath[^] may do the job for you. It's a C library I've used in several projects along with libtomcrypt. These are in ansi C. Their source is clean. Public domain. Check out the libs of this guy, they are excellent. The LICENSE file:
LibTomMath is hereby released into the Public Domain.
-- Tom St Denis
-
Depending on what you need libtommath[^] may do the job for you. It's a C library I've used in several projects along with libtomcrypt. These are in ansi C. Their source is clean. Public domain. Check out the libs of this guy, they are excellent. The LICENSE file:
LibTomMath is hereby released into the Public Domain.
-- Tom St Denis
-1 down vote favorite I have this program that needs to handle large numbers to factorize a number into primes.. Just like the RSA factorization challenge. I got this list in a txt file with prime numbers. this is the piece of code I use to make that list: int export_list (int lim = 50) { int last_in_txt = 0; { ifstream infile ("Primes.txt"); int k; while(infile >> k) { last_in_txt = k; } } // Now last_in_txt is assigned properly, and Primes.txt is closed cout << "\nLast number in \"Primes.txt\": " << last_in_txt << endl << endl; cout << "Press to start appending primes... "; cin.get(); cout << "\nAppend started:\n"; last_in_txt++; ofstream file ("Primes.txt" , ios::app); int x, counter; if (file.is_open()) // if it opens correctly { for (x = last_in_txt , counter = 0 ; counter < lim ; x++ , counter++) { if (check_prime (x)) // returns 1 when x is prime, returns 0 when not { cout << "Appending " << x << "\t\t" << "Estimated time remaining: " << (lim - counter) / 1000 <