Cryptology ePrint Archive: Report 2015/1138

Lightweight CRC-based Authentication

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

Abstract: Low-cost resource-constrained devices can allocate very limited resources for implementing security. At the same time, they still require some level of protection. In this paper, we present a lightweight message authentication scheme based on Cyclic Redundancy Check (CRC). The presented CRC inherits the implementation simplicity of the conventional CRC checksum except that the LFSR implementing its encoding and decoding is made re-programmable. Similarly to previously proposed cryptographic CRCs, it detects both random and malicious errors without increasing bandwidth. The main difference from previous approaches is that we use arbitrary instead of irreducible generator polynomials. This eliminates the need for irreducibility tests. We provide a detailed quantitative analysis of the achieved security as a function of message and CRC sizes. The results show that the presented scheme is particularly suitable for the authentication of short messages.

Category / Keywords: secret-key cryptography / Message authentication; data integrity protection; hash function; CRC; error-detection

Date: received 24 Nov 2015, last revised 8 Dec 2015

Contact author: dubrova at kth se

Available format(s): PDF | BibTeX Citation

Note: Acknowledgement is added

Version: 20151208:151310 (All versions of this report)

Short URL: ia.cr/2015/1138

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]