Message Authentication Based on Cryptographically Secure CRC without Polynomial Irreducibility Test

In this paper, we present a message authentication scheme based on cryptographically secure cyclic redundancy check (CRC). Similarly to previously proposed cryptographically secure CRCs, the presented one detects both random and malicious errors without increasing bandwidth. The main difference from...

Full description

Saved in:
Bibliographic Details
Published inCryptography and communications Vol. 10; no. 2; pp. 383 - 399
Main Authors Dubrova, Elena, Näslund, Mats, Selander, Göran, Lindqvist, Fredrik
Format Journal Article
LanguageEnglish
Published New York Springer US 01.03.2018
Springer Nature B.V
Subjects
Circuits
Coding and Information Theory
Communications Engineering
Computer Science
CRC
Cryptography
Data Structures and Information Theory
Hash function
Information and Communication
LFSR
Mathematics of Computing
Message authentication
Networks
Polynomials
Quantitative analysis
Redundancy
Special Issue on Sequences and Their Applications
94A62
LFSR
Hash function
94A60
CRC
Message authentication
Online AccessGet full text

Cover

More Information
Summary:In this paper, we present a message authentication scheme based on cryptographically secure cyclic redundancy check (CRC). Similarly to previously proposed cryptographically secure CRCs, the presented one detects both random and malicious errors without increasing bandwidth. The main difference from previous approaches is that we use random 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.
ISSN:1936-2447
1936-2455
1936-2455
DOI:10.1007/s12095-017-0227-8