Fast message authentication using efficient polynomial evaluation
From MaRDI portal
(Redirected from Publication:4639340)
Recommendations
Cites work
- A shift register construction of unconditionally secure authentication codes
- An upper bound on<tex>k/n</tex>for affine-invariant codes with fixed<tex>d/n</tex>(Corresp.)
- Bit-serial Reed - Solomon encoders
- Codes for Interactive Authentication
- scientific article; zbMATH DE number 1676640 (Why is no real title available?)
- scientific article; zbMATH DE number 429512 (Why is no real title available?)
- scientific article; zbMATH DE number 54007 (Why is no real title available?)
- scientific article; zbMATH DE number 1024067 (Why is no real title available?)
- scientific article; zbMATH DE number 1030979 (Why is no real title available?)
- scientific article; zbMATH DE number 204179 (Why is no real title available?)
- scientific article; zbMATH DE number 1406774 (Why is no real title available?)
- scientific article; zbMATH DE number 1406792 (Why is no real title available?)
- New hash functions and their use in authentication and set equality
- Prime numbers and computer methods for factorization
- The complexity of decoders--II: Computational work and decoding time
- Universal hashing and authentication codes
- Universal hashing and multiple authentication
Cited in
(7)- Message authentication based on cryptographically secure CRC without polynomial irreducibility test
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
- MMH: Software message authentication in the Gbit/second rates
- Artificial Intelligence and Soft Computing - ICAISC 2004
- On Efficient Message Authentication Via Block Cipher Design Techniques
- Message Authentication on 64-Bit Architectures
- Fast Software Encryption
This page was built for publication: Fast message authentication using efficient polynomial evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4639340)
