THE PROOF BY 2M-1: A LOW-COST METHOD TO CHECK ARITHMETIC COMPUTATIONS

摘要

Injecting faults into an arithmetic device is a way of attacking cryptographic devices. The proof by 2~m-1 is a method to detect arithmetic errors induced by this attack without having to duplicate the computations. This method is simple and not too expensive, in terms of computation power when the arithmetic in software and in terms of both silicon surface and power consumption when the arithmetic operations are performed by a hard-wired operator. In that the proof by 2~m-1 is well-suited for martcards, in which these resources are limited. The proof by 2~m-1 is scalable, in that the designer can choose the parameter m, which determines the level of protection offered and the resources needed for the verification.