Home > Explore Content > All Issues > Article View
Hardware Fault Attack Resistant RSA-CRT with Parallel Support
Journal of The Korea Society of Computer and Information
Abbr :
JKSCI
2012, 17(5), pp.59-70
Publisher : The Korean Society Of Computer And Information
Research Area : Computer Science
2012, 17(5), pp.59-70
Publisher : The Korean Society Of Computer And Information
Research Area : Computer Science
-
RSA-CRT is one of the commonly used techniques to speedup RSA operation. Since RSA-CRT performs its operations based on the modulus of two private primes, it is about four times faster than RSA. In RSA, the two primes are normally thrown away after generating the public key pair. However, in RSA-CRT, the two primes are directly used in RSA operations. This led to hardware fault attacks which can be used to factor the public modulus. The most common way to counter these attacks is based on error propagation. In these schemes, all the outputs of RSA are affected by the infected error which makes it difficult for an adversary to use the output to factor the public modulus. However, the error propagation has sequentialized the RSA operation. Moreover, these schemes have been found to be still vulnerable to hardware fault attacks. In this paper, we propose two new RSA-CRT schemes which are both resistant to hardware fault attack and support parallel execution: one uses common modulus and the other one perform operations in each prime modulus. Both proposed schemes takes about a time equal to two exponentiations to complete the RSA operation if parallel execution is fully used and can protect the two private primes from hardware fault attacks.
156 Viewed
Print this page
Download PDF