Re: (new?) factorization technique

Gene Wagenbreth wrote:
> Mike Amling
>
> Can you give some large examples and the time to factor them ?

   It would behoove someone who's writing a factoring algorithm to find
out how to generate and multiply random prime numbers in their preferred
programming language, to get test data. Here's one way to do it Java.

import java.math.BigInteger;
import java.util.Random;

final class GenComp {
   static final int BITLENGTH=60;
   // Note: Testing does not need secure random numbers.
   static final Random noise=new Random();

   public static void main(String[] args) {
     BigInteger composite=new BigInteger(BITLENGTH/2, 30, noise).
      multiply(new BigInteger(BITLENGTH/2, 30, noise));
     // Now you can print out the composite, or factor it using
     // code written in Java.
     System.out.println(BITLENGTH+"-bit composite is (hex):");
     System.out.println(composite.toString(16));
   }
}

   You can increase the BITLENGTH from trivial 60 to world-class 600 in
increments. Here's one sample:
60-bit composite is (hex):
C6722C7441D100B

   I don't have any factoring software, but I expect someone reading
this will have the sample factored in a jiffy.

--Mike Amling
Received on Thu Sep 29 21:39:34 2005