Efficient GCD Computation for Big Integers on Xeon Phi Coprocessor

Efficient calculation of the greatest common divisor (GCD) for big integers each whose number of bits is greater than or equal to 1024 has drawn a considerable amount of attention because it can be used to detect a weakness of the RSA security infrastructure. This paper presents a parallel binary GC...

Full description

Bibliographic Details

Published in:	2014 9th IEEE International Conference on Networking, Architecture, and Storage pp. 113 - 117
Main Authors:	Jie Chen, Watson, William, Chen, Mayee F.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.08.2014
Subjects:	Arrays Coprocessors GCD Graphics processing units Instruction sets OpenMP Parallel algorithms RSA Vectorization Vectors Xeon Phi
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!