GPU-based acceleration of the linear complexity test for random number
- Authors
- 표창우
- Issue Date
- 23-Jan-2018
- Publisher
- Elsevier
- Citation
- Journal of Parallel and Distributed Computing, v.1, no.1, pp.1 - 28
- Journal Title
- Journal of Parallel and Distributed Computing
- Volume
- 1
- Number
- 1
- Start Page
- 1
- End Page
- 28
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/4072
- ISSN
- 0743-7315
- Abstract
- The Linear Complexity Test is a statistical test for verifying the randomness of a binary sequence produced by a random number generator (RNG). It is the most time-consuming test in the widely used randomness testing suite that was published by the National Institute of Standards and Technology (NIST). The slow performance of the original Linear Complexity Test implementation is one of the major hurdles in the RNG testing process. In this work, we present a parallelized implementation of the Linear Complexity Test for GPU computation. We incorporate two levels of parallelism and various design optimization approaches to accelerate the test execution on modern GPU architectures. To further enhance the performance, we also create a hybrid computation approach that uses both CPU and GPU simultaneously. We achieve a speedup of more than 4,000 times over the original Linear Complexity Test implementation from NIST (27 times over the previous best implementation of the test).
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > Computer Engineering Major > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/4072)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.