Re: [openssl-users] Chinese remainder algorithm

2018-08-20 Thread Jan Bilek
Hi Thulasi, Thank you for your email, it was an inspiration for our team to follow up. Final solution then looks like this: bool InitKey(RSA_ptr& pkey) { //Recalculate Modulus from provided components BnCtx ctx; { const BIGNUM* p; const BIGNUM* q; RSA_get0_factors(pkey.get(),

Re: [openssl-users] Chinese remainder algorithm

2018-08-01 Thread Thulasi Goriparthi
Hello Jan, Decide on what your public exponent(e) should be, and either use RSA_X931_derive_ex() if you are using an older openssl which supports this function or follow rsa_builtin_keygen() from crypto/rsa/rsa_gen.c on how to derive private exponent(d) and modulus(n). By the way, technically, yo

[openssl-users] Chinese remainder algorithm

2018-07-31 Thread Jan Bilek
Hi all, I need to reconstruct public and private keys for data signing operation from p, q, dmp1, dmq1 and iqmp. When I fill values in as per below then OpenSSL complains about missing d. RSA* pkey = RSA_new(); pkey->n = NULL; pkey->e = NULL; pkey->d = NULL; pkey->p= BN_b