Hehe, my bad, it just happend to be that the random seed in the
generate-config-files yielded zero for the 3 first random generations, i
ran the config again and now i get "more random" numbers :D
On Fri, 27 Feb 2009 14:32:21 +0100, Atle Mauland <atl...@stud.ntnu.no>
wrote:
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
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?
_______________________________________________
viff-devel mailing list (http://viff.dk/)
viff-devel@viff.dk
http://lists.viff.dk/listinfo.cgi/viff-devel-viff.dk
_______________________________________________
viff-devel mailing list (http://viff.dk/)
viff-devel@viff.dk
http://lists.viff.dk/listinfo.cgi/viff-devel-viff.dk
