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 l
Quoting Martin Geisler <[EMAIL PROTECTED]>:
> Hi everybody
>
> >> I am confused about the notion of security via adversary traces
> >> presented in those papers. It is described via two properties:
> >>
> >> * Identity Property: a public state P can only lead to one other
> >> public state P', re
Quoting "D. J. Bernstein" <[EMAIL PROTECTED]>:
>
> Martin Geisler writes:
> > I would love to build a set of Python bindings for it and see it
> > running in VIFF... :-)
>
> Python NaCl is on our essential-items todo list. It'd be great if you
> have time to help out. Since this is CACE work I'd s
Quoting Brian Graversen <[EMAIL PROTECTED]>:
> Second, I'm not sure what is possible yet. Ivan said he know some guy that
> could
> do tricks with the HSM, so it would be possible to do all kinds of stuff, but
> I
> think we need to look at the performance side of it, perhaps a software
> implemen
Quoting Martin Geisler <[EMAIL PROTECTED]>:
> Hi everybody,
>
> We have talked on and off about making a front-end compiler for VIFF and
> today I figured that I would try making such a guy...
This is nice, and indeed is exactly what we have talked about doing for some
time. If for no other reaso
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 genera
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
Quoting Martin Geisler <[EMAIL PROTECTED]>:
> Martin Geisler <[EMAIL PROTECTED]> writes:
>
> Hi everybody,
>
> I would just like to point out that I have kick-started the
> viff-patches mailing list with a mostly-for-fun two player runtime
> based on ElGamal. See the patches here:
Isn't a mail li
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 multip
Quoting Martin Geisler <[EMAIL PROTECTED]>:
> I tried running benchmark using only my own computer, and there it takes
> about 12 ms pr multiplication or a little more than 10 times as much as
> the normal passively secure multiplication.
>
> This is not so strange -- I have skipped all the oppotu
10 matches
Mail list logo
