Exploiting the Floating-Point Computing Power of GPUs for RSA
- 1 January 2014
- book chapter
- Published by Springer Nature
- p. 198-215
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A GPU implementation of the Montgomery multiplication algorithm for elliptic curve cryptography2013
- Low-Latency Elliptic Curve Scalar MultiplicationInternational Journal of Parallel Programming, 2012
- RNS-Based Elliptic Curve Point Multiplication for Massive Parallel ArchitecturesThe Computer Journal, 2011
- Elliptic Curve point multiplication on GPUs2010
- ECM on Graphics Cards2009
- Efficient Acceleration of Asymmetric Cryptography on Graphics Hardware2009
- Public-Key Cryptography Standards (PKCS) #1: RSA Cryptography Specifications Version 2.12003
- Use of Elliptic Curves in Cryptography2000
- Analyzing and comparing Montgomery multiplication algorithmsIEEE Micro, 1996
- Elliptic curve cryptosystemsMathematics of Computation, 1987