mirror of
https://github.com/guanzhi/GmSSL.git
synced 2026-05-11 10:56:17 +08:00
403 lines
10 KiB
C
403 lines
10 KiB
C
/* ====================================================================
|
|
* Copyright (c) 2015-2016 The GmSSL Project. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
*
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in
|
|
* the documentation and/or other materials provided with the
|
|
* distribution.
|
|
*
|
|
* 3. All advertising materials mentioning features or use of this
|
|
* software must display the following acknowledgment:
|
|
* "This product includes software developed by the GmSSL Project.
|
|
* (http://gmssl.org/)"
|
|
*
|
|
* 4. The name "GmSSL Project" must not be used to endorse or promote
|
|
* products derived from this software without prior written
|
|
* permission. For written permission, please contact
|
|
* guanzhi1980@gmail.com.
|
|
*
|
|
* 5. Products derived from this software may not be called "GmSSL"
|
|
* nor may "GmSSL" appear in their names without prior written
|
|
* permission of the GmSSL Project.
|
|
*
|
|
* 6. Redistributions of any form whatsoever must retain the following
|
|
* acknowledgment:
|
|
* "This product includes software developed by the GmSSL Project
|
|
* (http://gmssl.org/)"
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE GmSSL PROJECT ``AS IS'' AND ANY
|
|
* EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE GmSSL PROJECT OR
|
|
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
|
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
|
|
* OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
* ====================================================================
|
|
*
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
#include "internal/cryptlib.h"
|
|
|
|
#if !defined(OPENSSL_NO_SKF) && !defined(OPENSSL_NO_RSA)
|
|
# include <openssl/err.h>
|
|
# include <openssl/rsa.h>
|
|
# include <openssl/skf.h>
|
|
# include <openssl/gmapi.h>
|
|
|
|
/* Wrapper functions */
|
|
|
|
RSA *RSA_new_from_RSAPUBLICKEYBLOB(const RSAPUBLICKEYBLOB *blob)
|
|
{
|
|
RSA *ret = NULL;
|
|
RSA *rsa = NULL;
|
|
|
|
if (!blob) {
|
|
GMAPIerr(GMAPI_F_RSA_NEW_FROM_RSAPUBLICKEYBLOB,
|
|
ERR_R_PASSED_NULL_PARAMETER);
|
|
return NULL;
|
|
}
|
|
|
|
if (!(rsa = RSA_new())) {
|
|
GMAPIerr(GMAPI_F_RSA_NEW_FROM_RSAPUBLICKEYBLOB,
|
|
ERR_R_MALLOC_FAILURE);
|
|
return NULL;
|
|
}
|
|
|
|
if (!RSA_set_RSAPUBLICKEYBLOB(rsa, blob)) {
|
|
GMAPIerr(GMAPI_F_RSA_NEW_FROM_RSAPUBLICKEYBLOB,
|
|
GMAPI_R_INVALID_RSA_PUBLIC_KEY);
|
|
goto end;
|
|
}
|
|
|
|
ret = rsa;
|
|
rsa = NULL;
|
|
|
|
end:
|
|
RSA_free(rsa);
|
|
return ret;
|
|
}
|
|
|
|
int RSA_set_RSAPUBLICKEYBLOB(RSA *rsa, const RSAPUBLICKEYBLOB *blob)
|
|
{
|
|
int ret = 0;
|
|
BIGNUM *n = NULL;
|
|
BIGNUM *e = NULL;
|
|
|
|
if (!rsa || !blob) {
|
|
GMAPIerr(GMAPI_F_RSA_SET_RSAPUBLICKEYBLOB,
|
|
ERR_R_PASSED_NULL_PARAMETER);
|
|
return 0;
|
|
}
|
|
|
|
if ((blob->BitLen < OPENSSL_RSA_FIPS_MIN_MODULUS_BITS)
|
|
|| (blob->BitLen > sizeof(blob->Modulus) * 8)
|
|
|| (blob->BitLen % 8 != 0)) {
|
|
GMAPIerr(GMAPI_F_RSA_SET_RSAPUBLICKEYBLOB,
|
|
GMAPI_R_INVALID_RSA_KEY_LENGTH);
|
|
return 0;
|
|
}
|
|
|
|
if (!(n = BN_bin2bn(blob->Modulus, sizeof(blob->Modulus), NULL))) {
|
|
GMAPIerr(GMAPI_F_RSA_SET_RSAPUBLICKEYBLOB,
|
|
GMAPI_R_INVALID_RSA_PUBLIC_KEY);
|
|
goto end;
|
|
}
|
|
|
|
if (!(e = BN_bin2bn(blob->PublicExponent,
|
|
sizeof(blob->PublicExponent), NULL))) {
|
|
GMAPIerr(GMAPI_F_RSA_SET_RSAPUBLICKEYBLOB,
|
|
GMAPI_R_INVALID_RSA_PUBLIC_KEY);
|
|
goto end;
|
|
}
|
|
|
|
if (!RSA_set0_key(rsa, n, e, NULL)) {
|
|
GMAPIerr(GMAPI_F_RSA_SET_RSAPUBLICKEYBLOB,
|
|
GMAPI_R_INVALID_RSA_PUBLIC_KEY);
|
|
goto end;
|
|
}
|
|
n = NULL;
|
|
e = NULL;
|
|
|
|
ret = 1;
|
|
|
|
end:
|
|
BN_free(n);
|
|
BN_free(e);
|
|
return ret;
|
|
}
|
|
|
|
int RSA_get_RSAPUBLICKEYBLOB(RSA *rsa, RSAPUBLICKEYBLOB *blob)
|
|
{
|
|
const BIGNUM *n;
|
|
const BIGNUM *e;
|
|
|
|
if (!rsa || !blob) {
|
|
GMAPIerr(GMAPI_F_RSA_GET_RSAPUBLICKEYBLOB,
|
|
ERR_R_PASSED_NULL_PARAMETER);
|
|
return 0;
|
|
}
|
|
|
|
RSA_get0_key(rsa, &n, &e, NULL);
|
|
|
|
if (!n || !e) {
|
|
GMAPIerr(GMAPI_F_RSA_GET_RSAPUBLICKEYBLOB,
|
|
GMAPI_R_INVALID_RSA_PUBLIC_KEY);
|
|
return 0;
|
|
}
|
|
|
|
if (RSA_bits(rsa) > sizeof(blob->Modulus) * 8
|
|
|| RSA_bits(rsa) % 8 != 0) {
|
|
GMAPIerr(GMAPI_F_RSA_GET_RSAPUBLICKEYBLOB,
|
|
GMAPI_R_INVALID_RSA_PUBLIC_KEY);
|
|
return 0;
|
|
}
|
|
|
|
memset(blob, 0, sizeof(RSAPUBLICKEYBLOB));
|
|
blob->AlgID = SGD_RSA;
|
|
blob->BitLen = RSA_bits(rsa);
|
|
|
|
if (BN_bn2bin(n, blob->Modulus +
|
|
sizeof(blob->Modulus) - BN_num_bytes(n)) <= 0) {
|
|
GMAPIerr(GMAPI_F_RSA_GET_RSAPUBLICKEYBLOB,
|
|
GMAPI_R_ENCODE_RSA_PUBLIC_KEY_FAILED);
|
|
return 0;
|
|
}
|
|
|
|
if (BN_bn2bin(e, blob->PublicExponent +
|
|
sizeof(blob->PublicExponent) - BN_num_bytes(e)) <= 0) {
|
|
GMAPIerr(GMAPI_F_RSA_GET_RSAPUBLICKEYBLOB,
|
|
GMAPI_R_ENCODE_RSA_PUBLIC_KEY_FAILED);
|
|
return 0;
|
|
}
|
|
|
|
return 1;
|
|
}
|
|
|
|
RSA *RSA_new_from_RSAPRIVATEKEYBLOB(const RSAPRIVATEKEYBLOB *blob)
|
|
{
|
|
RSA *ret = NULL;
|
|
RSA *rsa = NULL;
|
|
|
|
if (!blob) {
|
|
GMAPIerr(GMAPI_F_RSA_NEW_FROM_RSAPRIVATEKEYBLOB,
|
|
ERR_R_PASSED_NULL_PARAMETER);
|
|
return NULL;
|
|
}
|
|
|
|
if (!(rsa = RSA_new())) {
|
|
GMAPIerr(GMAPI_F_RSA_NEW_FROM_RSAPRIVATEKEYBLOB,
|
|
ERR_R_MALLOC_FAILURE);
|
|
return NULL;
|
|
}
|
|
|
|
if (!RSA_set_RSAPRIVATEKEYBLOB(rsa, blob)) {
|
|
GMAPIerr(GMAPI_F_RSA_NEW_FROM_RSAPRIVATEKEYBLOB,
|
|
GMAPI_R_INVALID_RSA_PRIVATE_KEY);
|
|
goto end;
|
|
}
|
|
|
|
ret = rsa;
|
|
rsa = NULL;
|
|
|
|
end:
|
|
RSA_free(rsa);
|
|
return ret;
|
|
}
|
|
|
|
int RSA_set_RSAPRIVATEKEYBLOB(RSA *rsa, const RSAPRIVATEKEYBLOB *blob)
|
|
{
|
|
int ret = 0;
|
|
BIGNUM *n = NULL;
|
|
BIGNUM *e = NULL;
|
|
BIGNUM *d = NULL;
|
|
BIGNUM *p = NULL;
|
|
BIGNUM *q = NULL;
|
|
BIGNUM *dmp1 = NULL;
|
|
BIGNUM *dmq1 = NULL;
|
|
BIGNUM *iqmp = NULL;
|
|
|
|
if (!rsa || !blob) {
|
|
GMAPIerr(GMAPI_F_RSA_SET_RSAPRIVATEKEYBLOB,
|
|
ERR_R_PASSED_NULL_PARAMETER);
|
|
return 0;
|
|
}
|
|
|
|
if (blob->AlgID != SGD_RSA) {
|
|
GMAPIerr(GMAPI_F_RSA_SET_RSAPRIVATEKEYBLOB,
|
|
GMAPI_R_INVALID_ALGOR);
|
|
return 0;
|
|
}
|
|
|
|
if (blob->BitLen < OPENSSL_RSA_FIPS_MIN_MODULUS_BITS
|
|
|| blob->BitLen > sizeof(blob->Modulus) * 8
|
|
|| blob->BitLen % 8 != 0
|
|
|| blob->BitLen % 16 != 0) {
|
|
GMAPIerr(GMAPI_F_RSA_SET_RSAPRIVATEKEYBLOB,
|
|
ERR_R_PASSED_NULL_PARAMETER);
|
|
return 0;
|
|
}
|
|
|
|
if (!(n = BN_bin2bn(blob->Modulus, sizeof(blob->Modulus), NULL))
|
|
|| !(e = BN_bin2bn(blob->PublicExponent, sizeof(blob->PublicExponent), NULL))
|
|
|| !(d = BN_bin2bn(blob->PrivateExponent, sizeof(blob->PrivateExponent), NULL))
|
|
|| !(p = BN_bin2bn(blob->Prime1, sizeof(blob->Prime1), NULL))
|
|
|| !(q = BN_bin2bn(blob->Prime2, sizeof(blob->Prime2), NULL))
|
|
|| !(dmp1 = BN_bin2bn(blob->Prime1Exponent, sizeof(blob->Prime1Exponent), NULL))
|
|
|| !(dmq1 = BN_bin2bn(blob->Prime2Exponent, sizeof(blob->Prime2Exponent), NULL))
|
|
|| !(iqmp = BN_bin2bn(blob->Coefficient, sizeof(blob->Coefficient), NULL))) {
|
|
GMAPIerr(GMAPI_F_RSA_SET_RSAPRIVATEKEYBLOB, ERR_R_BN_LIB);
|
|
goto end;
|
|
}
|
|
|
|
if (!RSA_set0_key(rsa, n, e, d)) {
|
|
GMAPIerr(GMAPI_F_RSA_SET_RSAPRIVATEKEYBLOB,
|
|
GMAPI_R_INVALID_RSA_PRIVATE_KEY);
|
|
goto end;
|
|
}
|
|
n = NULL;
|
|
e = NULL;
|
|
d = NULL;
|
|
|
|
if (!RSA_set0_factors(rsa, p, q)) {
|
|
GMAPIerr(GMAPI_F_RSA_SET_RSAPRIVATEKEYBLOB,
|
|
GMAPI_R_INVALID_RSA_PRIVATE_KEY);
|
|
goto end;
|
|
}
|
|
p = NULL;
|
|
q = NULL;
|
|
|
|
if (!RSA_set0_crt_params(rsa, dmp1, dmq1, iqmp)) {
|
|
GMAPIerr(GMAPI_F_RSA_SET_RSAPRIVATEKEYBLOB,
|
|
GMAPI_R_INVALID_RSA_PRIVATE_KEY);
|
|
goto end;
|
|
}
|
|
dmp1 = NULL;
|
|
dmq1 = NULL;
|
|
iqmp = NULL;
|
|
|
|
ret = 1;
|
|
|
|
end:
|
|
BN_free(n);
|
|
BN_free(e);
|
|
BN_free(d);
|
|
BN_free(p);
|
|
BN_free(q);
|
|
BN_free(dmp1);
|
|
BN_free(dmq1);
|
|
BN_free(iqmp);
|
|
return ret;
|
|
}
|
|
|
|
int RSA_get_RSAPRIVATEKEYBLOB(RSA *rsa, RSAPRIVATEKEYBLOB *blob)
|
|
{
|
|
const BIGNUM *n;
|
|
const BIGNUM *e;
|
|
const BIGNUM *d;
|
|
const BIGNUM *p;
|
|
const BIGNUM *q;
|
|
const BIGNUM *dmp1;
|
|
const BIGNUM *dmq1;
|
|
const BIGNUM *iqmp;
|
|
|
|
if (!rsa || !blob) {
|
|
GMAPIerr(GMAPI_F_RSA_GET_RSAPRIVATEKEYBLOB,
|
|
ERR_R_PASSED_NULL_PARAMETER);
|
|
return 0;
|
|
}
|
|
|
|
if (RSA_bits(rsa) > sizeof(blob->Modulus) * 8
|
|
|| RSA_bits(rsa) % 8 != 0) {
|
|
GMAPIerr(GMAPI_F_RSA_GET_RSAPRIVATEKEYBLOB,
|
|
ERR_R_PASSED_NULL_PARAMETER);
|
|
return 0;
|
|
}
|
|
|
|
RSA_get0_key(rsa, &n, &e, &d);
|
|
RSA_get0_factors(rsa, &p, &q);
|
|
RSA_get0_crt_params(rsa, &dmp1, &dmq1, &iqmp);
|
|
|
|
if (!n || !e || !d) {
|
|
GMAPIerr(GMAPI_F_RSA_GET_RSAPRIVATEKEYBLOB,
|
|
GMAPI_R_INVALID_RSA_PRIVATE_KEY);
|
|
return 0;
|
|
}
|
|
|
|
memset(blob, 0, sizeof(RSAPRIVATEKEYBLOB));
|
|
|
|
blob->AlgID = SGD_RSA;
|
|
blob->BitLen = RSA_bits(rsa);
|
|
|
|
if (BN_bn2bin(n, blob->Modulus +
|
|
sizeof(blob->Modulus) - BN_num_bytes(n)) <= 0) {
|
|
GMAPIerr(GMAPI_F_RSA_GET_RSAPRIVATEKEYBLOB,
|
|
GMAPI_R_INVALID_RSA_PRIVATE_KEY);
|
|
return 0;
|
|
}
|
|
|
|
if (BN_bn2bin(e, blob->PublicExponent +
|
|
sizeof(blob->PublicExponent) - BN_num_bytes(e)) <= 0) {
|
|
GMAPIerr(GMAPI_F_RSA_GET_RSAPRIVATEKEYBLOB,
|
|
GMAPI_R_INVALID_RSA_PRIVATE_KEY);
|
|
return 0;
|
|
}
|
|
|
|
if (BN_bn2bin(d, blob->PrivateExponent +
|
|
sizeof(blob->PrivateExponent) - BN_num_bytes(d)) <= 0) {
|
|
GMAPIerr(GMAPI_F_RSA_GET_RSAPRIVATEKEYBLOB,
|
|
GMAPI_R_INVALID_RSA_PRIVATE_KEY);
|
|
return 0;
|
|
}
|
|
|
|
if (p && BN_bn2bin(p, blob->Prime1 +
|
|
sizeof(blob->Prime1) - BN_num_bytes(p)) < 0) {
|
|
GMAPIerr(GMAPI_F_RSA_GET_RSAPRIVATEKEYBLOB,
|
|
GMAPI_R_INVALID_RSA_PRIVATE_KEY);
|
|
return 0;
|
|
}
|
|
|
|
if (q && BN_bn2bin(q, blob->Prime2 +
|
|
sizeof(blob->Prime2) - BN_num_bytes(q)) < 0) {
|
|
GMAPIerr(GMAPI_F_RSA_GET_RSAPRIVATEKEYBLOB,
|
|
GMAPI_R_INVALID_RSA_PRIVATE_KEY);
|
|
return 0;
|
|
}
|
|
|
|
if (dmp1 && BN_bn2bin(dmp1, blob->Prime1Exponent +
|
|
sizeof(blob->Prime1Exponent) - BN_num_bytes(dmp1)) < 0) {
|
|
GMAPIerr(GMAPI_F_RSA_GET_RSAPRIVATEKEYBLOB,
|
|
GMAPI_R_INVALID_RSA_PRIVATE_KEY);
|
|
return 0;
|
|
}
|
|
|
|
if (dmq1 && BN_bn2bin(dmq1, blob->Prime2Exponent +
|
|
sizeof(blob->Prime2Exponent) - BN_num_bytes(dmq1)) < 0) {
|
|
GMAPIerr(GMAPI_F_RSA_GET_RSAPRIVATEKEYBLOB,
|
|
GMAPI_R_INVALID_RSA_PRIVATE_KEY);
|
|
return 0;
|
|
}
|
|
|
|
if (iqmp && BN_bn2bin(iqmp, blob->Coefficient +
|
|
sizeof(blob->Coefficient) - BN_num_bytes(iqmp)) < 0) {
|
|
GMAPIerr(GMAPI_F_RSA_GET_RSAPRIVATEKEYBLOB,
|
|
GMAPI_R_INVALID_RSA_PRIVATE_KEY);
|
|
return 0;
|
|
}
|
|
|
|
return 1;
|
|
}
|
|
#endif
|