Modular multiplication using OpenCL

Discussion created by iLoop on Mar 26, 2010
Latest reply on May 14, 2010 by kang13
Trying to speed up RSA using the GPU



Has someone tried to do modular multiplication using OpenCL?


Im trying to make a program that is able to compute C=m^e mod n (RSA encryption), but i need some help.

I hope someone has done this before and are willing to share there experiences with me.



So fare i have tried to use OpenSSL to generate the n value and this works fine, but i like to send this to the GPU to compute the C value in parallel