[viff-devel] Division

[Martin Geisler]

"Atle Mauland" <atlema at stud.ntnu.no> writes:

Hi Atle!

> 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.

Ohh, cool!

> I have a couple of question regarding implemented functions in VIFF:
>
> Is there any way to do shared division / modulus in VIFF?

We have this example program which Sigurd knows more about:

  http://hg.viff.dk/viff/file/tip/apps/divide.py

> What's the best way of getting a shared random bit / value?

That would be prss_share_random(field, binary=True):

  http://viff.dk/doc/passive.html#viff.passive.PassiveRuntime.prss_share_random

> I talked to my supervisor, Tord, and we are wondering if there is any
> bit-decomposition function implemented?

Not directly, but maybe as part of the comparison protocols -- Tomas?

-- 
Martin Geisler

VIFF (Virtual Ideal Functionality Framework) brings easy and efficient
SMPC (Secure Multiparty Computation) to Python. See: http://viff.dk/.
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 196 bytes
Desc: not available
URL: <http://lists.viff.dk/pipermail/viff-devel-viff.dk/attachments/20090218/abe0adef/attachment.pgp>