摘要 |
<p>A method (500) of generating a cryptographic checksum for a message M(ϰ) is provided. The method comprises pseudo-randomly selecting (502) a generator polynomial p(ϰ) from the set of polynomials of degree n over a Galois Field and calculating (504) the cryptographic checksum as a first function g of a division of a second function of M(ϰ), f (M(ϰ)), modulo p(ϰ), g(f (M(ϰ)) mod p(ϰ)). The generator polynomial p(ϰ) is pseudo-randomly selected based on a first cryptographic key. By replacing a standard checksum, such as a Cyclic Redundancy Check (CRC), 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. Further, a corresponding computer program, a corresponding computer program product, and a checksum generator for generating a cryptographic checksum, are provided.</p> |