Static stages for heterogeneous programming

2017 ◽  
Vol 1 (OOPSLA) ◽  
pp. 1-27 ◽  
Author(s):  
Adrian Sampson ◽  
Kathryn S. McKinley ◽  
Todd Mytkowicz

Author(s):  
Wenlu Zhang ◽  
Wayne Joubert ◽  
Peng Wang ◽  
Bei Wang ◽  
William Tang ◽  
...  


2015 ◽  
Vol 71 (6) ◽  
pp. 2204-2220 ◽  
Author(s):  
Moisés  Viñas ◽  
Zeki  Bozkus ◽  
Basilio  B.  Fraguela ◽  
Diego  Andrade ◽  
Ramón  Doallo




2015 ◽  
Vol 51 ◽  
pp. 110-119 ◽  
Author(s):  
Moisés Viñas ◽  
Basilio B. Fraguela ◽  
Zeki Bozkus ◽  
Diego Andrade


Author(s):  
Song Chen ◽  
M.M. Eshaghian ◽  
R.F. Freund ◽  
J.L. Potter ◽  
Ying-Chieh Wu


2013 ◽  
Vol 73 (12) ◽  
pp. 1627-1638 ◽  
Author(s):  
Moisés Viñas ◽  
Zeki Bozkus ◽  
Basilio B. Fraguela




2012 ◽  
Vol 532-533 ◽  
pp. 1080-1084 ◽  
Author(s):  
Zhi Cai Shi ◽  
Can Qun Yang ◽  
Qiang Wu

MD5 Crypt is a cryptographic algorithm used commonly in UNIX system for authentication. Thanks to the additional randomization of the salt and complexity of the scheme, it makes the traditional password cracking techniques invalid on common computing systems so that the security of the system is guaranteed. As a result of the thriving of petaflops heterogeneous supercomputer system in recent decades, the security of MD5 Crypt is facing a threat of brute-force attack again. However, the complexity of heterogeneous programming and the sophistication of large-scale parallelism still hamper the password recovering. In this paper, we implemented brute-force attack of MD5 Crypt on Tianhe-1A,the world’s fastest supercomputer, by organizing the assignment between CPU and GPU reasonably and making several optimizations according to MD5 Crypt for GPU. Based on the experimental results, our algorithm achieves a great scalability. It checked more than 1.8 billion passwords in a second on the full system. Thus it issues a new challenge to the security of MD5 crypt for authentication.



Sign in / Sign up

Export Citation Format

Share Document