Montgomery's Multiplication Technique: How to Make It Smaller and Faster
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Enhanced Montgomery Multiplication
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
GPU Gems 2: Programming Techniques for High-Performance Graphics and General-Purpose Computation (Gpu Gems)
Fast and approximate stream mining of quantiles and frequencies using graphics processors
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Exploiting the Power of GPUs for Asymmetric Cryptography
CHES '08 Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems
Efficient Acceleration of Asymmetric Cryptography on Graphics Hardware
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
pSHS: a scalable parallel software implementation of Montgomery multiplication for multicore systems
Proceedings of the Conference on Design, Automation and Test in Europe
GPU accelerated cryptography as an OS service
Transactions on computational science XI
Random sampling for short lattice vectors on graphics cards
CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems
Parallel shortest lattice vector enumeration on graphics cards
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
| Hi-index | 0.00 |
The computing power and programmability of graphics processing units (GPUs) has been successfully exploited for calculations unrelated to graphics, such as data processing, numerical algorithms, and secret key cryptography. In this paper, a new variant of the Montgomery exponentiation algorithm that exploits the processing power and parallelism of GPUs is designed and implemented. Furthermore, performance tests are conducted and the suitability of the proposed algorithm for accelerating public key encryption is discussed.