There are two talks about how to implement AES efficiently, this one
describes on slide 9 how one will typically combine SubBytes, ShiftRows,
and MixColumns into one operation operating on diagonals. I don't know
if that will matter for us?
I don't think so because lookup tables are not efficient in MPC.
viff-devel mailing list (http://viff.dk/)