Message Authentication Based on Cryptographically Secure CRC without Polynomial Irreducibility Test
| Autor: | Göran Selander, Fredrik Lindqvist, Elena Dubrova, Mats Näslund |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Polynomial
Theoretical computer science Computer Networks and Communications Applied Mathematics 010102 general mathematics Hash function Bandwidth (signal processing) 02 engineering and technology 01 natural sciences 020202 computer hardware & architecture Secure Hash Standard Computational Theory and Mathematics Cyclic redundancy check ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION 0202 electrical engineering electronic engineering information engineering Irreducibility Message authentication code 0101 mathematics Data Authentication Algorithm Computer Science::Cryptography and Security Mathematics |
| Zdroj: | Cryptography and Communications. 10:383-399 |
| ISSN: | 1936-2455 1936-2447 |
| DOI: | 10.1007/s12095-017-0227-8 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink