Generating cryptographic checksums

US10623187B2 · kind B2 · utility

Assignee

• Telefonaktiebolaget LM Ericsson (Publ) · SE

Inventors

• Elena Dubrova · Sollentuna, SE
• Gunnar Mildh · Sollentuna, SE
• Mats Näslund · Bromma, SE
• Göran Selander · Bromma, SE

Key dates

• Filing date: May 4, 2015
• Grant date: Apr 14, 2020
• Expiry date: Dec 24, 2035

Classification

• Technology area (CPC H): Electricity
• CPC primary: H04L2209/34
• WIPO field: Digital communication
• WIPO sector: Electrical engineering

Abstract

A method (400) of generating a cryptographic checksum for a message M(x) is provided. The method is performed by a communication device, such as a sender or a receiver, and comprises calculating (405) the cryptographic checksum as a first function g of a division of a second function of M(x), ƒ(M(x)), modulo a generator polynomial p(x) of degree n, g(ƒ(M(x))mod p(x)). The generator polynomial is calculated (403) as p(x)=(1−x)·P1(x), and P1(x) is a primitive polynomial of degree n−1. The primitive polynomial is selected (402), based on a first cryptographic key, from the set of primitive polynomials of degree n−1 over a Galois Field. By replacing a standard checksum with a cryptographic checksum, an efficient message authentication is provided. The proposed cryptographic checksum may be used for providing integrity assurance on the message, i.e., for detecting random and intentional message changes, with a known level of security. The proposed checksum is capable of detecting double-bit errors which may be introduced by a Turbo code decoder.