I have just submitted to CAESAR a lightweight parallelizable AEAD based on xor and modulo 2^b + sums called ++AE. Click on the diagram below for ++AE description.
As the diagram makes evident, only 4 sums per block + 1 cipher extra call per message are required by ++AE, plus 2 sums per associated data block.
I now that many sound designs will be submitted to CAESAR, and ++AE has now a reallly challenging process in front of it. I want to express my best wishes to all the authors competing (and specially to ++AE one ;-)
No hay comentarios:
Publicar un comentario