RSA and the factorizing problem

[dsouza123]

Austin, have you tried your algorithm with 64-bit numbers to verify it works ?
It is much easier to work with values of that size for testing, much faster,
smaller memory requirements then scaling up to larger numbers once it's functional.

Posit, with assembly you may be able to get the entire program to reside in the CPU cache.
There have been multiple threads on optimizing, sometimes resulting in order of magnitude
speed increases from the original compiled code. Some from pairing instructions, some from
using SIMD instructions : MMX, 3DNOW, SSE, SSE2, and some by better encoding
and alignment of data.