On the public citation graph
Fast message authentication using efficient polynomial evaluation
0 signed · 39 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-16767-6_61openalex-snapshot
On the number of divisors of a polynomial over GF(2)
inferredcites →https://doi.org/10.1007/3-540-44750-4_3openalex-snapshot
Bucket Hashing and its Application to Fast Message Authentication
inferredcites →https://doi.org/10.1007/3-540-48329-2_28openalex-snapshot
On Families of Hash Functions via Geometric Codes and Concatenation
inferredcites →https://doi.org/10.1007/3-540-48329-2_30openalex-snapshot
Codes for Interactive Authentication
inferredcites →https://doi.org/10.1007/3-540-48658-5_14openalex-snapshot
Cryptanalysis of the Gemmell and Naor Multiround Authentication Protocol
inferredcites →https://doi.org/10.1007/3-540-48658-5_32openalex-snapshot
The Security of Cipher Block Chaining
inferredcites →https://doi.org/10.1007/3-540-49264-x_13openalex-snapshot
Secure Multiround Authentication Protocols
inferredcites →https://doi.org/10.1007/3-540-68697-5_2openalex-snapshot
Universal Hashing and Multiple Authentication
inferredcites →https://doi.org/10.1007/978-1-4757-1089-2openalex-snapshot
Prime Numbers and Computer Methods for Factorization
inferredcites →https://doi.org/10.1007/978-3-7091-3008-7_6openalex-snapshot
The Complexity of Decoders
inferredcites →https://doi.org/10.1007/978-94-011-1806-4openalex-snapshot
Computational and Algorithmic Problems in Finite Fields
inferredcites →https://doi.org/10.1007/bf01388561openalex-snapshot
A shift register construction of unconditionally secure authentication codes
inferredcites →https://doi.org/10.1007/bf01388651openalex-snapshot
Universal hashing and authentication codes
inferredcites →https://doi.org/10.1007/bf01578872openalex-snapshot
Contemporary cryptology—The science of information integrity
inferredcites →https://doi.org/10.1016/0022-0000(81)90033-7openalex-snapshot
New hash functions and their use in authentication and set equality
inferredcites →https://doi.org/10.1049/ip-e.1992.0036openalex-snapshot
Division and bit-serial multiplication over GF(qm)
inferredcites →https://doi.org/10.1109/5.4445openalex-snapshot
A survey of information authentication
inferredcites →https://doi.org/10.1109/9780470544327openalex-snapshot
Contemporary Cryptology: The Science of Information Integrity
inferredcites →https://doi.org/10.1109/tit.1969.1054254openalex-snapshot
An upper bound onk/nfor affine-invariant codes with fixedd/n(Corresp.)
inferredcites →https://doi.org/10.1109/tit.1971.1054578openalex-snapshot
The complexity of decoders--II: Computational work and decoding time
inferredcites →https://doi.org/10.1109/tit.1982.1056591openalex-snapshot
Bit-serial Reed - Solomon encoders
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/sec.1764openalex-snapshot
Authenticated encryption: how reordering can impact performance
inferred← citeshttps://doi.org/10.1007/11502760_3openalex-snapshot
The Poly1305-AES Message-Authentication Code
inferred← citeshttps://doi.org/10.1007/11586821_21openalex-snapshot
Unconditionally Secure Information Authentication in Presence of Erasures
inferred← citeshttps://doi.org/10.1007/11967668_21openalex-snapshot
Non-degrading Erasure-Tolerant Information Authentication with an Application to Multicast Stream Authentication over Lossy Channels
inferred← citeshttps://doi.org/10.1007/3-540-45067-x_45openalex-snapshot
Square Hash with a Small Key Size
inferred← citeshttps://doi.org/10.1007/3-540-45247-8_7openalex-snapshot
Fast Universal Hashing with Small Keys and No Preprocessing: The PolyR Construction
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_14openalex-snapshot
UMAC: Fast and Secure Message Authentication
inferred← citeshttps://doi.org/10.1007/3-540-48910-x_3openalex-snapshot
Software Performance of Universal Hash Functions
inferred← citeshttps://doi.org/10.1007/3-540-49248-8_3openalex-snapshot
Cryptographic Primitives for Information Authentication — State of the Art
inferred← citeshttps://doi.org/10.1007/3-540-69053-0_12openalex-snapshot
Bucket Hashing with a Small Key Size
inferred← citeshttps://doi.org/10.1007/978-3-032-09598-5_4openalex-snapshot
Obtaining Reliability from Untrusted and Unreliable Clouds and (Social) Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-74462-7_23openalex-snapshot
Message Authentication on 64-Bit Architectures
inferred← citeshttps://doi.org/10.1007/978-3-540-76900-2_14openalex-snapshot
On Efficient Message Authentication Via Block Cipher Design Techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-31284-7_6openalex-snapshot
Authenticated Encryption: How Reordering Can Impact Performance
inferred← citeshttps://doi.org/10.1007/bfb0052345openalex-snapshot
MMH: Software message authentication in the Gbit/second rates
inferred← citeshttps://doi.org/10.1016/j.ffa.2014.10.008openalex-snapshot
A survey of some recent bit-parallel GF(2n) multipliers
inferred← citeshttps://doi.org/10.1109/tc.2002.1017695openalex-snapshot
Bit-parallel finite field multiplier and squarer using polynomial basis
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.