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 have a couple of question regarding implemented functions in VIFF:
Is there any way to do shared division / modulus in VIFF?
What's the best way of getting a shared random bit / value?
I talked to my supervisor, Tord, and we are wondering if there is any
bit-decomposition function implemented?
- Atle
_______________________________________________
viff-devel mailing list (http://viff.dk/)
viff-devel@viff.dk
http://lists.viff.dk/listinfo.cgi/viff-devel-viff.dk
