Re: [VANILLA-LIST:2131] gmp vs mp

[Dave Ahn <ahn@vec.wfubmc.edu>]

On Tue, Mar 16, 1999 at 08:35:51PM +0100, Kurt Siegl wrote:
> 
> They depend on arbitrary long integer arithmetic. If you write a module
> which may raise an 256 bit int to the power of an other 256 bit int within
> a reasonable time, we might do that ;-)

> With GMP the whole RSA algoritm consists basically of 1 line, the rest is I/O.

Yup.  Kurt, do you want me to give you a copy of the math functions that
the U.S. RES-RSA uses?

-- 
Dave Ahn <ahn@vec.wfubmc.edu>        |  "When you were born, you cried and the
                                     |  world rejoiced.  Try to live your life
Virtual Endoscopy Center             |  so that when you die, you will rejoice
Wake Forest Univ. School of Medicine |  and the world will cry."  -1/2 jj^2