Bulk GCD Computation Using a GPU to Break Weak RSA Keys

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 easil...

Full description

Bibliographic Details

Published in:	2015 IEEE International Parallel and Distributed Processing Symposium Workshop pp. 385 - 394
Main Authors:	Fujita, Toru, Nakano, Koji, Ito, Yasuaki
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01-05-2015
Subjects:	Acceleration Approximation algorithms Approximation methods CUDA Encryption Euclidean Algorithm GPU Graphics processing units Instruction sets Parallel Algorithm
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!