Functionally safe encryption for vehicle to anything communication

A method, comprising:

• converting a Galois Field (GF) representation of an encryption key from a first factor to a second factor and a third factor;
• converting a GF representation of a data block from the first factor to the second factor and the third factor;
• determining a Hamming distance between a current value of a Gray code counter and a previous value of a Gray code counter;
• determining whether the Hamming distance equals one;
• generating one or more counter blocks for an encryption algorithm based on a determination that the Hamming distance equals one;
• generating a first cypher block of the data block, the first cypher block having the GF representation of the second factor, based on the encryption algorithm and the encryption key having the GF representation of the second factor, wherein the encryption algorithm is applied based on the second factor GF;
• generating a second cypher block of the data block, the second cypher block having the GF representation of the third factor, based on the encryption algorithm and the encryption key having the GF representation of the third factor, wherein the encryption algorithm is applied based on the third factor GF;
• and
• determining whether a fault in the execution of the encryption algorithm exists based on the first cypher block and the second cypher block;
• wherein:
• the GF representation of the first factor is GF(28);
• the GF representation of the second factor is GF((24)2);
• and
• the GF representation of the third factor is GF(((22)2)2).

A computer program product comprising a non-transitory machine-readable medium storing instructions that, when executed by at least one processor, cause the at least one processor to:

• convert a Galois Field (GF) representation of an encryption key from a first factor to a second factor and a third factor;
• convert a GF representation of a data block from the first factor to the second factor and the third factor;
• determine a Hamming distance between a current value of a Gray code counter and a previous value of a Gray code counter;
• determine whether the Hamming distance equals one;
• generate one or more counter blocks for an encryption algorithm based on a determination that the Hamming distance equals one;
• generate a first cypher block of the data block, the first cypher block having the GF representation of the second factor, based on the encryption algorithm and the encryption key having the GF representation of the second factor, wherein the encryption algorithm is applied based on the second factor GF;
• generate a second cypher block of the data block, the second cypher block having the GF representation of the third factor, based on the encryption algorithm and the encryption key having the GF representation of the third factor, wherein the encryption algorithm applied based on the third factor GF;
• and
• determine whether a fault in the execution of the encryption algorithm exists based on the first cypher block and the second cypher block,
• wherein:
• the GF representation of the first factor is GF(28);
• the GF representation of the second factor is GF((24)2);
• and
• the GF representation of the third factor is GF(((22)2)2).