On Wed, 18 Feb 2009 18:13:00 +0100, Martin Geisler <m...@daimi.au.dk> wrote:
"Atle Mauland" <atl...@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
Have any of you guys tried to include this file into the runtime.py file
by overriding the __div__ operator? My attempt was obviously a fiasco :P
If the overriding of __div__ does not work, any suggestion of how I could
get my application to perform shared division with divide.py in
cooperation with VIFF?
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?
_______________________________________________
viff-devel mailing list (http://viff.dk/)
viff-devel@viff.dk
http://lists.viff.dk/listinfo.cgi/viff-devel-viff.dk
