Good evening,
I've been doing some more performance measurements. This time I replaced
the shamir.share and shamir.recombine functions with fake versions (see
revision f7d1f7cd3dda). The replacements do a zero-degree sharing:
>>> viff.shamir.share(17, 1, 3)
[(1, 17), (2, 17), (3, 17)]
>>> viff.s
Yes, that is a good idea -- I'll try to rip out the Shamir sharing and
recombination next. Then we can gradually strip things down to the bare
"machinery" behind it all.
___
viff-devel mailing list (http://viff.dk/)
viff-devel@viff.dk
http://lists.viff.dk
Hi folks,
Very interesting! I think Martin is right that there is something lost
in general machinery, but I don't think this means that none of this
machinery can be removed.
There are bigger lumps of computation that could be done with one call
to a faster module. Examples:
1) Lagrange
Hi everybody,
I've done some tests where I replaced the normal FieldElement class
with a new class named FakeFieldElement (rev 464008ada9c2). This class
fakes all computations by always returning 1.
Timing 1 multiplications using the real and the fake field
elements give these results between
New submission from Martin Geisler <[EMAIL PROTECTED]>:
We want to do tests where all local computations are replaced by dummy
implementations. An example would be the multiplications of field
elements done in viff.field.
Having timing results from such a dummy implementation would give us a
bas
