title: Java API for Prime Number and Factorization
body: <p>I am looking for Java API for fast primality testing and factorization of Big Numbers. Any pointer would be very helpful to me.</p>
  
  <h2>Update</h2>
  
  <p>The resources I found are:</p>
  
  <ul>
  <li><a href="http://docs.oracle.com/javase/7/docs/api/java/math/BigInteger.html" rel="noreferrer">BigInteger</a> - doesn't have factorization</li>
  <li><a href="http://commons.apache.org/proper/commons-math/apidocs/org/apache/commons/math3/primes/Primes.html" rel="noreferrer">Primes</a> - deals with integer</li>
  <li><a href="http://jscience.org/api/org/jscience/mathematics/number/LargeInteger.html" rel="noreferrer">LargeInteger</a> - doesn't have factorization</li>
  </ul>
  
  <p>I am looking forward to an API which uses <a href="http://en.wikipedia.org/wiki/Lenstra_elliptic_curve_factorization" rel="noreferrer">Elliptic Curve Factorization</a> or <a href="http://en.wikipedia.org/wiki/Quadratic_sieve" rel="noreferrer">Quadratic Sieve</a>.</p>
  
  <p>Another resource: <a href="http://www.alpertron.com.ar/ECM.HTM" rel="noreferrer">Factorization using the Elliptic Curve Method</a>.</p>
  
  <p>Limit: Number with 10000 digit.</p>