Hi,
There are two talks about how to implement AES efficiently, this one
http://www.hyperelliptic.org/SPEED/slides09/kasper-aes_speedcc09_slides.pdf
describes on slide 9 how one will typically combine SubBytes, ShiftRows,
and MixColumns into one operation operating on diagonals. I don't know
Hi everybody,
The slides from SPEED-CC are up:
http://www.hyperelliptic.org/SPEED/
http://www.hyperelliptic.org/SPEED/timetable.html
There are two talks about how to implement AES efficiently, this one
http://www.hyperelliptic.org/SPEED/slides09/kasper-aes_speedcc09_slides.pdf
describes
Janus Dam Nielsen writes:
> Hi Marcel,
>
> I am not opposed to your suggestion. However I would like to point out
> that in VIFF you compute on shares and not field elements!
Well, we've actually made the outer runtime interfaces in such a way
that add, mul, xor, etc... accept both integers, Fie
