Faster binary-field multiplication and faster binary-field macs

DOI10.1007/978-3-319-13051-4_6MaRDI QIDQ2798606zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1583946
• Efficient software implementation of binary field arithmetic using vector instruction sets
• McBits: fast constant-time code-based cryptography
• Message Authentication on 64-Bit Architectures
• MMH: Software message authentication in the Gbit/second rates

Cited in

(8)

• A Macsyma implementation of Zeilberger's fast algorithm
• Variants of Wegman-Carter message authentication code supporting variable tag lengths
• Efficient Linear Array for Multiplication over NIST Recommended Binary Fields
• Faster multiplication in \(\mathbb{Z}_{2^m}[x]\) on Cortex-M4 to speed up NIST PQC candidates
• High performance GHASH function for long messages
• Fast transforms over finite fields of characteristic two
• Multiplication
• Exploring the advantages and challenges of Fermat NTT in FHE acceleration

Describes a project that uses

Uses Software

• McBits

This page was built for publication: Faster binary-field multiplication and faster binary-field macs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2798606)