Bernstein bound on WCS is tight -- repairing Luykx-Preneel optimal forgeries

DOI10.1007/978-3-319-96881-0_8zbMath1423.94092OpenAlexW2795046822MaRDI QIDQ1784090

Mridul Nandi

Publication date: 26 September 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-96881-0_8

zbMATH Keywords

key-recoveryforgeryGalois Counter Mode (GCM)universal hashAXUpolynomial hashWegman-Carter-Shoup (WCS) authenticators

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Variants of Wegman-Carter message authentication code supporting variable tag lengths ⋮ Categorization of faulty nonce misuse resistant message authentication

This page was built for publication: Bernstein bound on WCS is tight -- repairing Luykx-Preneel optimal forgeries