[viff-devel] viff-devel Digest, Vol 17, Issue 12

[Sigurd Torkel Meldgaard]

> Hi! I'm experimenting with the RSA problem in VIFF, so i need to have
> 2 primes (p and q) plus d (the inverse) secret shared.

I Guess what you really want is the inverse operation modulo pq. What
I implemented is integer division (rounding down)

If you are allowed to reveal n=pq then the inverse of d can be
computed with a protocol like

[r] = random element
c = open(d[r])
k = c inverse mod n (if it exists, otherwise retry with new randomness)
return [r]k

Hope you can use that

Sigurd