Quoting Martin Geisler [EMAIL PROTECTED]:
..
but this makes
viff.test.test_runtime_comp.ActiveToft05GreaterThanEqualTest
go into what looks like a never-ending loop?! You you have a better
solution, then I'm all ears! :-)
What is wrong with just doing a single normal secure
Quoting Claudio Orlandi [EMAIL PROTECTED]:
Cool -- that sounds like a good opportunity to finally sit down and
create a slow-but-simple elliptic curve library for VIFF.
I suggest you to use some library instead. Some of the algorithms are
quite involved...
I'm sure you can find C/C++ good
Quoting Martin Geisler [EMAIL PROTECTED]:
Claudio Orlandi [EMAIL PROTECTED] writes:
From reading the Wikipedia page linked below it seems very simple
to implement. But if it should be fast, then a library is of course
much better than a home-grown Python version.
A general remark about
Quoting Martin Geisler [EMAIL PROTECTED]:
Martin Geisler [EMAIL PROTECTED] writes:
It does 466 comparisons to sort 52 numbers (32-bit) and it takes
about 4 minutes both share and sort the numbers on thyra{01,02,03}
on DAIMI.
In case nobody has noticed, I wanted to see how long it would
