[viff-devel] Division

[Atle Mauland]

On Wed, 18 Feb 2009 18:13:00 +0100, Martin Geisler <mg at daimi.au.dk> wrote:

> "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):

I have written my code like this just to try this function:

	bit1 = runtime.prss_share_random(Zp, True)
         bit2 = runtime.prss_share_random(Zp, True)
         bit3 = runtime.prss_share_random(Zp, True)

but every time I always get 0 (zero) as the answer for all bits... What do  
I do wrong?

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