Help with arbitrary precision arithmetic

[Charlie Murphy]

I'm currently working on trying to find the prime factorization of
100 - 500 digit integers (for the RSA challange) and have written 
a number of routines using a SUN arbitrary precision language tool.
However, that language does not support a number of features that I
will need, and therefore I must write arbitrary arithmetic procedures.

What I need help with is an integer division algorithm. I have written
one but it is horribly inefficient. My implementation is with arrays.
I think my other routines (+,-,*, and others) are fairly efficient, but
I could use help with any and all of them.

Is my implementation fastest? should I use linked lists? Any suggestions?

Thanks in advance.

-charlie
-- 
| charlie murphy				   |    """ """    /   \__
| charlie at mooney.nldn.albany.edu		   |	(o) (o)   /       \
| National Lightning Detection Network		   |       <      \        \_
| Disclaimer: who started the disclaimer nonsense? |	  \__/	  /          \