Faster Binary-Field Multiplication and Faster Binary-Field MACs

DOI10.1007/978-3-319-13051-4_6zbMath1382.94063OpenAlexW2129638043MaRDI QIDQ2798606

Daniel J. Bernstein, Tung Chou

Publication date: 13 April 2016

Published in: Selected Areas in Cryptography -- SAC 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13051-4_6

zbMATH Keywords

performancemessage authenticationuniversal hashingpolynomial multiplicationFFTs

Mathematics Subject Classification ID

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

Related Items

Variants of Wegman-Carter message authentication code supporting variable tag lengths ⋮ Fast transforms over finite fields of characteristic two ⋮ Unnamed Item

Uses Software

• McBits

This page was built for publication: Faster Binary-Field Multiplication and Faster Binary-Field MACs