Fast message authentication using efficient polynomial evaluation

DOI10.1007/BFb0052346zbMath1385.94081OpenAlexW1587512694MaRDI QIDQ4639340

Ben Smeets, Valentine B. Afanassiev, Christian Gehrmann

Publication date: 9 May 2018

Published in: Fast Software Encryption (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0052346

Mathematics Subject Classification ID

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

Related Items

On Efficient Message Authentication Via Block Cipher Design Techniques, MMH: Software message authentication in the Gbit/second rates, A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers

Cites Work

• New hash functions and their use in authentication and set equality
• A shift register construction of unconditionally secure authentication codes
• Universal hashing and authentication codes
• Universal Hashing and Multiple Authentication
• Bit-serial Reed - Solomon encoders
• Codes for Interactive Authentication
• An upper bound on<tex>k/n</tex>for affine-invariant codes with fixed<tex>d/n</tex>(Corresp.)
• The complexity of decoders--II: Computational work and decoding time
• Prime numbers and computer methods for factorization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item