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 stuff out there, and as far as I
understood, you
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.
It's also about security. I would like an implementation that deals,
at least, with the most common side-channel
, 2008 at 2:15 PM, Martin Geisler [EMAIL PROTECTED] wrote:
Claudio Orlandi [EMAIL PROTECTED] writes:
Hi Claudio
if you are interested just in passive security for the 2 party case
you can implement the following protocol for multiplication.
You never commented on my implementation of your
___
viff-devel mailing list (http://viff.dk/)
viff-devel@viff.dk
http://lists.viff.dk/listinfo.cgi/viff-devel-viff.dk
--
Claudio Orlandi
PhD student,
Department of Computer Science, Turing-223
Aarhus Universitet, Denmark
http://www.daimi.au.dk/~orlandi
testing,
-Marc
___
viff-devel mailing list (http://viff.dk/)
viff-devel@viff.dk
http://lists.viff.dk/listinfo.cgi/viff-devel-viff.dk
--
Claudio Orlandi
PhD student,
Department of Computer Science, Turing-223
Aarhus Universitet, Denmark
http
On Wed, Nov 4, 2009 at 10:15 AM, Marcel Keller mkel...@cs.au.dk wrote:
Claudio Orlandi wrote:
On Wed, Nov 4, 2009 at 5:46 AM, Marcel Keller mkel...@cs.au.dk wrote:
Hi Claudio and Jesper,
In the code review of the OrlandiRuntime we found two points, we want to
discuss with you.
Step 3
On Wed, Nov 4, 2009 at 3:18 PM, Marcel Keller mkel...@cs.au.dk wrote:
Claudio Orlandi schrieb:
On Wed, Nov 4, 2009 at 10:15 AM, Marcel Keller mkel...@cs.au.dk wrote:
Claudio Orlandi wrote:
On Wed, Nov 4, 2009 at 5:46 AM, Marcel Keller mkel...@cs.au.dk wrote:
Hi Claudio and Jesper
