Thread: question
View Single Post
Old 2009-07-06, 00:41   #4
ATH
Einyen
 
ATH's Avatar
 
Dec 2003
Denmark

3,413 Posts
Default

Thanks, it was just something like this I was looking for:

(2kp+1)=0 (mod q) => 2kp+1= c*q => c*q - 2kp = 1

Then I can find c and more importantly -2*k my using the algorithm on GCD(p,q). Allready tested it and it works great.

Last fiddled with by ATH on 2009-07-06 at 00:52
ATH is offline   Reply With Quote