9476

Analysis of Parallel Montgomery Multiplication in CUDA

Yuheng Liu
San Jose State University
San Jose State University, 2013

@article{liu2013analysis,

   title={Analysis of Parallel Montgomery Multiplication in CUDA},

   author={Liu, Yuheng},

   year={2013}

}

Download Download (PDF)   View View   Source Source   

946

views

For a given level of security, elliptic curve cryptography (ECC) offers improved efficiency over classic public key implementations. Point multiplication is the most common operation in ECC and, consequently, any significant improvement in perfor- mance will likely require accelerating point multiplication. In ECC, the Montgomery algorithm is widely used for point multiplication. The primary purpose of this project is to implement and analyze a parallel implementation of the Montgomery algorithm as it is used in ECC. Specifically, the performance of CPU-based Montgomery multiplication and a GPU-based implementation in CUDA are compared.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: