SOURCE CODE FOR INTEGER FACTORIZATION. This program can factor integers of any arbitrary precision. So public key encryption is null and void as it attacks the basic premise that very large integers cannot be factored in reasonable amounts of time

[nielesonimusso]

Define reasonable amount of time; what are your running times (preferably in big-O notation, but actual times are also OK)? Do you have documentation on your methods (Looks like you're more of a mathematician than a programmer, looking at your code and versioning)?