A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Bulk GCD Computation Using a GPU to Break Weak RSA Keys

2015
*
2015 IEEE International Parallel and Distributed Processing Symposium Workshop
*

RSA is one the most well-known public-key cryptosystems widely used for secure data transfer. An RSA encryption key includes a modulus n which is the product of two large prime numbers p and q. If an RSA modulus n can be decomposed into p and q, the corresponding decryption key can be computed easily from them and the original message can be obtained using it. RSA cryptosystem relies on the hardness of factorization of RSA modulus. Suppose that we have a lot of encryption keys collected from

doi:10.1109/ipdpsw.2015.54
dblp:conf/ipps/FujitaNI15
fatcat:rnbas5jrznenhge2vwrjiybuwe