![]() |
|
|
#1 |
|
Nov 2002
2×37 Posts |
Does anyone know any Large Integer Libraries except GMP?????
thanks andi314 |
|
|
|
|
|
#3 |
|
Nov 2002
2·37 Posts |
Thanks for your answer but i already know giantint. (fotgot to mention it)
|
|
|
|
|
|
#4 |
|
Apr 2003
Berlin, Germany
16916 Posts |
D.J.Bernstein has some large integer multiplication benchmarks with links to the tested packages/libraries:
http://cr.yp.to/speed/mult.html On http://www.jjj.de/ you can find more. These pages should give a good starting point. |
|
|
|
|
|
#5 |
|
Sep 2002
12268 Posts |
For Delphi or Free Pascal
Giant integer library available, 67 functions, as source code for pascal/dephi. It is fast and updated regularly, maintained for 4+ years. Number size bounded by available memory. Also source code for : Elliptic Curve over GF(p), RSA, ElGamal, DSA, GOSTDSA, PrimeGeneration, Elliptic Curve ElGamal, Elliptic Curve DSA http://triade.studentenweb.org/GInt/index.htm |
|
|
|
|
|
#6 | |
|
Aug 2002
2·33 Posts |
Quote:
I did use NTL for a project a few years ago. It worked out well as it also had some handy number theory routines. I did a very basic Quadratic Sieve implementation that had a broken option for Multiple Polynomials. May I ask what are you programming? |
|
|
|
|
|
|
#7 |
|
"Mark"
Apr 2003
Between here and the
3·2,447 Posts |
If you have a PowerMac, you can check out:
http://developer.apple.com/hardware/...libraries.html It is not as fast as GMP thought. I know because I've used both. |
|
|
|
|
|
#8 |
|
Jun 2003
Ottawa, Canada
3×17×23 Posts |
Andy,
You can take a look at this, never used it before so don't know how good/easy it is to use: http://math.libtomcrypt.org/ He also has a crypt library as well: http://libtomcrypt.org/ Jeff. |
|
|
|
|
|
#9 |
|
Sep 2002
Vienna, Austria
110110112 Posts |
Is there anything for VB?
|
|
|
|
|
|
#10 | |
|
Jun 2003
Russia, Novosibirsk
2×107 Posts |
Quote:
|
|
|
|
|
|
|
#11 |
|
Sep 2002
Vienna, Austria
3·73 Posts |
Could you please send it to me?
my E-mail address is wpolly0419#REMOVE#@yahoo.com.cn |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| k*b^n+/-c where b is an integer greater than 2 and c is an integer from 1 to b-1 | jasong | Miscellaneous Math | 5 | 2016-04-24 03:40 |
| suggestion: separation of libraries | ixfd64 | Software | 10 | 2011-01-20 23:02 |
| Interested in C/C++ libraries for factoring | PythonPower | Factoring | 27 | 2009-05-28 17:08 |
| Always an integer. | mfgoode | Puzzles | 18 | 2007-07-13 18:03 |
| implimentation of large integer operation | hashim kareem | Operation Billion Digits | 1 | 2005-03-05 13:51 |