Hi
Martin Geisler wrote:
viff-devel@viff.dk writes:
Hi everybody,
I don't know how many of you follow the commits to the VIFF repository?
Would anybody be interested in a mailing list for it?
Anyway -- the latest commit is this:
http://hg.viff.dk/viff/rev/5dd8c277268c
changeset:
Martin Geisler wrote:
[EMAIL PROTECTED] writes:
snip comparison return value disagreement
snip '05 variation
This does the same and avoids the conversion to GF(256), but may be
more expensive online (IIRC GF(256) computation is /really/ fast).
Well, that is easy to check. The timeit
Hi all
Tord Ingolf Reistad wrote:
As you are discussing implementing the algorithm from ICITS07, I have
improved on that to get a very effective algorithm. For p = 2^l - 1 and
using psaudorandom secret sharing. The comparison can be done in 5
rounds and 5l multiplications. The algorithm has
ARGH! I replied to this earlier, but only to Ivan.
Martin: You should be surprised that this goes wrong for me again, and
by the principle of least surprise, you should therefore set reply to be
to the list :-)
OK, here is what I wrote:
Hi all
Ivan Bjerre Damgård wrote:
Quoting Marcel
