Cryptology ePrint Archive: Report 2014/226

Weak-Key Analysis of POET

Mohamed Ahmed Abdelraheem and Andrey Bogdanov and Elmar Tischhauser

Abstract: We evaluate the security of the recently proposed authenticated encryption scheme POET with regard to weak keys when its universal hash functions are instantiated with finite field multiplications. We give explicit constructions for weak key classes not covered by POET's weak key testing strategy, and demonstrate how to leverage them to obtain universal forgeries.

Category / Keywords: secret-key cryptography / CAESAR, POET, Authenticated Encryption, Polynomial hashing, Forgery polynomials, Weak keys,

Date: received 28 Mar 2014, last revised 9 Apr 2014

Contact author: mohab at dtu dk

Available format(s): PDF | BibTeX Citation

Note: Editorial updates.

Version: 20140409:142622 (All versions of this report)

Short URL: ia.cr/2014/226

Discussion forum: Show discussion | Start new discussion