Ivan Bjerre Damgaard <[EMAIL PROTECTED]> writes:
> 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 alg
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
> 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, yo
"Claudio Orlandi" <[EMAIL PROTECTED]> writes:
>>> Converting this simple protocol to the active case is harder than
>>> expected, and I'm working on it right now.
>>
>> Great, I'm looking forward to it! :-)
>
> Well, if you have a lot of spare time you can start some
> preprocessing :)
Well, what
>> Converting this simple protocol to the active case is harder than
>> expected, and I'm working on it right now.
>
> Great, I'm looking forward to it! :-)
>
Well, if you have a lot of spare time you can start some preprocessing :)
In particular, I guess that the active protocol will almost surel
"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.
Excellent, thank you! I'm basically interested in anything we can come
up with :-)
I have posted an imple
