Side-channel Timing Attack of RSA on a GPU

被引:21
作者
Luo, Chao [1 ]
Fei, Yunsi [2 ]
Kaeli, David [2 ]
机构
[1] MathWorks, Natick, MA 01760 USA
[2] Northeastern Univ, Boston, MA 02115 USA
基金
美国国家科学基金会;
关键词
GPU; RSA; timing attack; MONTGOMERY EXPONENTIATION;
D O I
10.1145/3341729
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
To increase computation throughput, general purpose Graphics Processing Units (GPUs) have been leveraged to accelerate computationally intensive workloads. GPUs have been used as cryptographic engines, improving encryption/decryption throughput and leveraging the GPU's Single Instruction Multiple Thread (SIMT) model. RSA is a widely used public-key cipher and has been ported onto GPUs for signing and decrypting large files. Although performance has been significantly improved, the security of RSA on GPUs is vulnerable to side-channel timing attacks and is an exposure overlooked in previous studies. GPUs tend to be naturally resilient to side-channel attacks, given that they execute a large number of concurrent threads, performing many RSA operations on different data in parallel. Given the degree of parallel execution on a GPU, there will be a significant amount of noise introduced into the timing channel given the thousands of concurrent threads executing concurrently. In this work, we build a timing model to capture the parallel characteristics of an RSA public-key cipher implemented on a GPU. We consider optimizations that include using Montgomery multiplication and sliding-window exponentiation to implement cryptographic operations. Our timing model considers the challenges of parallel execution, complications that do not occur in single-threaded computing platforms. Based on our timing model, we launch successful timing attacks on RSA running on a GPU, extracting the private key of RSA. We also present an effective error detection and correction mechanism. Our results demonstrate that GPU acceleration of RSA is vulnerable to side-channel timing attacks. We propose several countermeasures to defend against this class of attacks.
引用
收藏
页数:18
相关论文
共 34 条
[1]  
Aciicmez O., 2005, 12th ACM Conference on Computer and Communications security, P139
[2]  
[Anonymous], 2008, NETWORKS 2008 THE13T, DOI DOI 10.1109/NETWKS.2008.4763727
[3]  
[Anonymous], 1994, TECHNICAL REPORT
[4]  
Arnaud Cyril, 2013, Topics in Cryptology - CT-RSA 2013. The Cryptographers Track at the RSA Conference 2013. Proceedings, P18, DOI 10.1007/978-3-642-36095-4_2
[5]  
Brumley Billy Bob, 2011, P EUR S RES COMP SEC
[6]  
Brumley D, 2003, USENIX ASSOCIATION PROCEEDINGS OF THE 12TH USENIX SECURITY SYMPOSIUM, P1
[7]   Macroscopic Fundamental Diagrams for Freeway Networks Theory and Observation [J].
Cassidy, Michael J. ;
Jang, Kitae ;
Daganzo, Carlos F. .
TRANSPORTATION RESEARCH RECORD, 2011, (2260) :8-15
[8]   Improving timing attack on RSA-CRT via error detection and correction strategy [J].
Chen, CaiSen ;
Wang, Tao ;
Tian, Junjian .
INFORMATION SCIENCES, 2013, 232 :464-474
[9]   Small solutions to polynomial equations, and low exponent RSA vulnerabilities [J].
Coppersmith, D .
JOURNAL OF CRYPTOLOGY, 1997, 10 (04) :233-260
[10]  
Dhem JF, 2000, LECT NOTES COMPUT SC, V1820, P167