Apparatus and method for comparing pairs of binary words

A hardware-implemented apparatus for comparing a pair of input binary words (u, u′), the apparatus comprising:

• a means for determining an intermediate binary word configured to determine an intermediate binary word (z) based on the pair of input binary words (u,u′), and compare, the intermediate binary word (z) to a reference binary word or to an inversion of the reference binary word;
• and
• a means for providing an error signal configured to provide an error signal (y) based on the intermediate binary word (z) and detect that the binary words of the pair of input binary words (u, u′) are equal or inverted with respect to each other to detect a faultless preceding processing of the pair of input binary words when the intermediate binary word (z) is equal to the reference binary word or equal to the inversion of the reference binary word, and to detect that the binary words of the pair of input binary words (u, u′) are not equal and not inverted with respect to each other to detect an erroneous preceding processing of the pair of input binary words when the intermediate binary word (z) is unequal to the reference binary word and unequal to the inversion of the reference binary word;
• wherein a bit of the intermediate binary word (z) depends on a XOR-combination of a binary constant, a bit of a first binary word of the pair of input binary words (u, u′), a corresponding bit of a second binary word of the pair of input binary words (u, u′), and a non-constant Boolean function of at least the bit of the first binary word of the pair of input binary words and the corresponding bit of the second binary word of the pair of input binary words.

A method for comparing a pair of input binary words (u, u′), the method comprising:

• determining an intermediate binary word (z) based on the pair of input binary words (u,u′), and comparing, the intermediate binary word (z) to a reference binary word or to an inversion of the reference binary word;
• and
• providing an error signal (y) based on the intermediate binary word (z) and detecting that the binary words of the pair of input binary words (u, u′) are equal or inverted with respect to each other to detect a faultless preceding processing of the pair of input binary words when the intermediate binary word (z) is equal to the reference binary word or equal to the inversion of the reference binary word, and detecting that the binary words of the pair of input binary words (u, u′) are not equal and not inverted with respect to each other to detect an erroneous preceding processing of the pair of input binary words when the intermediate binary word (z) is unequal to the reference binary word and unequal to the inversion of the reference binary word;
• wherein a bit of the intermediate binary word (z) depends on a XOR-combination of a binary constant, a bit of a first binary word of the pair of input binary words (u, u′), a corresponding bit of a second binary word of the pair of input binary words (u, u′), and a non-constant Boolean function of at least the bit of the first binary word of the pair of input binary words and the corresponding bit of the second binary word of the pair of input binary words.

A computer program with a program code which runs on a computer or a micro controller and is stored on a non-transitory computer-readable medium,

• wherein the program code performs a method for comparing a pair of input binary words (u, u′), the method comprising:
• determining an intermediate binary word (z) based on the pair of input binary words (u,u′), and comparing the intermediate binary word (z) to a reference binary word or to an inversion of the reference binary word;
• and
• providing an error signal (y) based on the intermediate binary word (z) and detecting that the binary words of the pair of input binary words (u, u′) are equal or inverted with respect to each other to detect a faultless preceding processing of the pair of input binary words when the intermediate binary word (z) is equal to the reference binary word or equal to the inversion of the reference binary word, and detecting that the binary words of the pair of input binary words (u, u′) are not equal and not inverted with respect to each other to detect an erroneous preceding processing of the pair of input binary words when the intermediate binary word (z) is unequal to the reference binary word and unequal to the inversion of the reference binary word;
• wherein a bit of the intermediate binary word (z) depends on a XOR-combination of a binary constant, a bit of a first binary word of the pair of input binary words (u, u′), a corresponding bit of a second binary word of the pair of input binary words (u, u′), and a non-constant Boolean function of at least the bit of the first binary word of the pair of input binary words and the corresponding bit of the second binary word of the pair of input binary words.