Fault resistant CRT-RSA scheme adopting a small exponent

Abstract

This paper considers a secure and efficient CRT-RSA scheme resistant to fault attacks. Recently, Boscher et al. proposed a secure CRT-RSA scheme by verifying signature using a public exponent. However, it is almost two times slower compared to the classical CRT-RSA signature when the exponent is expected to be a long number. We present a low-cost and secure CRT-RSA scheme by generating a small exponent for checking the correctness of signature. Furthermore, since our scheme can use fast double exponentiation algorithm based on right-to-left binary method having two exponents, it has low computational load compared to other existing schemes.