High‐speed parallel implementations of the rainbow method based on perfect tables in a heterogeneous system1. (18th February 2014)

• Record Type: Journal Article
• Authors: Kim, Jung Woo; Seo, Jungjoo; Hong, Jin; Park, Kunsoo; Kim, Sung‐Ryul
• Is Part Of: Software, practice & experience. Volume 45:Number 6(2015)
• Page Start: 837
• Page End: 855
• Publication Date: 2014-02-18
• Subjects: Computer software -- Periodicals; Computer programming -- Periodicals; Computer programs -- Periodicals; 005.3
• DOI: 10.1002/spe.2257
• Languages: English
• ISSNs: 0038-0644

Abstract

<abstract abstract-type="main" id="spe2257-abs-0001"> <title>Summary</title> <p id="spe2257-para-0002">The computing power of graphics processing units (GPU) has increased rapidly, and there has been extensive research on general‐purpose computing on GPU (GPGPU) for cryptographic algorithms such as RSA, Elliptic Curve Cryptosystem (ECC), NTRU, and Advanced Encryption Standard. With the rise of GPGPU, commodity computers have become complex heterogeneous GPU+CPU systems. This new architecture poses new challenges and opportunities in high‐performance computing. In this paper, we present high‐speed parallel implementations of the rainbow method based on perfect tables, which is known as the most efficient time‐memory trade‐off, in the heterogeneous GPU+CPU system. We give a complete analysis of the effect of multiple checkpoints on reducing the cost of false alarms and take advantage of it for load balancing between GPU and CPU. For GTX460, our implementation is about 1.86 and 3.25 times faster than other GPU‐accelerated implementations, RainbowCrack and Cryptohaze, respectively, and for GTX580, 1.53 and 2.40 times faster. Copyright © 2014 John Wiley &amp; Sons, Ltd.</p> </abstract>