Paper 2015/035

Cryptographically Secure CRC for Lightweight Message Authentication

Elena Dubrova, Mats Näslund, Göran Selander, and Fredrik Lindqvist

Abstract

A simple and practical hashing scheme based on Cyclic Redundancy Check (CRC) is presented. Similarly to previously proposed cryptographically secure CRCs, the presented one detects both, random and malicious, errors without increasing bandwidth. However, we use a product of irreducible polynomials instead of a single irreducible polynomial for generating the CRC. This is an advantage since smaller irreducible polynomials are easier to compute. The price we pay is that the probability that two different messages map into the same CRC increases. We provide a detailed quantitative analysis of the achieved security as a function of message and CRC sizes. The presented method seems to be particularly attractive for the authentication of short messages.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint. Minor revision.
Keywords
Hash functionmessage authenticationCRCerror-detectionLFSRirreducible polynomial
Contact author(s)
dubrova @ kth se
History
2015-01-15: received
Short URL
https://ia.cr/2015/035
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2015/035,
      author = {Elena Dubrova and Mats Näslund and Göran Selander and Fredrik Lindqvist},
      title = {Cryptographically Secure CRC for Lightweight Message Authentication},
      howpublished = {Cryptology ePrint Archive, Paper 2015/035},
      year = {2015},
      note = {\url{https://eprint.iacr.org/2015/035}},
      url = {https://eprint.iacr.org/2015/035}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.