inverse finding
Major Variola (ret)
mv at cdc.gov
Sun Mar 14 04:36:51 PST 2004
At 09:55 PM 3/12/04 -0800, Sarad AV wrote:
>if gcd(a,m)=1,
>for a*a inverse==1 mod m
>is it better to find
>a invese=a^(m-2) mod m by binary exponentiation
>modulo m or is it more time efficient by extended
>euclids algorithm for large 'm'?
I dunno, why don't you think about it some?
How are you going to land a sweet outsourced job
if you ask others to do your homework?
More information about the cypherpunks-legacy
mailing list