Hi,
I have developed a while ago a tool that uses OpenSSL in order to
perform such conversions (between SFM format and CRT format).
I have put it under SourceForge (source and binary):
http://rsaconverter.sourceforge.net/
The binary is for Windows but the sources (librsaconverter.c and
librsaconverter.h) are portable and they provide two functions :
SfmToCrt and CrtToSfm. In your case, you will use the function SfmToCrt
in order to compute p,q,dp,dq and u.
The mathematics behind are explained on the PDF linked on the project
page (idea based on Miller factoring algorithm as described on his 1976
paper).
By the way, is this kind of functionality interesting enough to be
integrated into OpenSSL code?
I hope this will help.
Cheers,
--
Mounir IDRASSI
IDRIX
http://www.idrix.fr
On 11/25/2010 1:32 PM, Chir wrote:
Hi guys,
i want to create a RSA structure to pass this to RSA_private_decrypt(). I am
not generating keys i am getting keys from second party. i have got N, D, E
but i dnt know how to generate p, q required to fill the RSA structure.
Please help.
Thanks
Chir
______________________________________________________________________
OpenSSL Project http://www.openssl.org
User Support Mailing List openssl-users@openssl.org
Automated List Manager majord...@openssl.org