Re: inverse finding

--- Tyler Durden <[EMAIL PROTECTED]> wrote: > And are you trying to suggest (On Cypherpunks, of > all places) that the US > government should somehow regulate outsourcing? It doesnot matter what i think.Neither can I help it It already is http://news.bbc.co.uk/1/hi/business/3535893.stm Any way

Re: inverse finding

'll probably get hammered on THIS list, which in general doesn't really trust ANY government to do much at all besides shore up its own power) -TD From: Sarad AV <[EMAIL PROTECTED]> To: [EMAIL PROTECTED] Subject: Re: inverse finding Date: Sun, 14 Mar 2004 05:40:43 -0800 (

Re: inverse finding

I can't stop outsourcing.Don't blame me.Blame your own govt. Sarath. --- "Major Variola (ret)" <[EMAIL PROTECTED]> wrote: > 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 > >mo

Re: inverse finding

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 y

Re: inverse finding

At 5:40 AM -0800 3/14/04, Sarad AV wrote: >I can't stop outsourcing.Don't blame me.Blame your own >govt. Bzzt. Right answer, wrong reason. Government don't "cause" markets. Cheers, RAH -- - R. A. Hettinga The Internet Bearer Underwriting Corporation 44 F

inverse finding

hi, 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'? thanks. Sarath. __ Do you Yahoo!? Yahoo! Mail - More reliable, m