sm2国密算法加解密、签名、验签QT工具源码（包含sm2,sm3和sm4源代码）

/*************************************************************************** * Copyright 2013 CertiVox UK Ltd. * * This file is part of CertiVox MIRACL Crypto SDK. * * The CertiVox MIRACL Crypto SDK provides developers with an * extensive and efficient set of cryptographic functions. * For further information about its features and functionalities please * refer to http://www.certivox.com * * * The CertiVox MIRACL Crypto SDK is free software: you can * redistribute it and/or modify it under the terms of the * GNU Affero General Public License as published by the * Free Software Foundation, either version 3 of the License, * or (at your option) any later version. * * * The CertiVox MIRACL Crypto SDK is distributed in the hope * that it will be useful, but WITHOUT ANY WARRANTY; without even the * implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. * See the GNU Affero General Public License for more details. * * * You should have received a copy of the GNU Affero General Public * License along with CertiVox MIRACL Crypto SDK. * If not, see <http://www.gnu.org/licenses/>. * * You can be released from the requirements of the license by purchasing * a commercial license. Buying such a license is mandatory as soon as you * develop commercial activities involving the CertiVox MIRACL Crypto SDK * without disclosing the source code of your own applications, or shipping * the CertiVox MIRACL Crypto SDK with a closed source product. * * ***************************************************************************/ /* * MIRACL E(F_p^2) support functions * mrecn2.c */ #include <stdlib.h> #include "miracl.h" #ifdef MR_STATIC #include <string.h> #endif #ifndef MR_EDWARDS BOOL ecn2_iszero(ecn2 *a) { if (a->marker==MR_EPOINT_INFINITY) return TRUE; return FALSE; } void ecn2_copy(ecn2 *a,ecn2 *b) { zzn2_copy(&(a->x),&(b->x)); zzn2_copy(&(a->y),&(b->y)); #ifndef MR_AFFINE_ONLY if (a->marker==MR_EPOINT_GENERAL) zzn2_copy(&(a->z),&(b->z)); #endif b->marker=a->marker; } void ecn2_zero(ecn2 *a) { zzn2_zero(&(a->x)); zzn2_zero(&(a->y)); #ifndef MR_AFFINE_ONLY if (a->marker==MR_EPOINT_GENERAL) zzn2_zero(&(a->z)); #endif a->marker=MR_EPOINT_INFINITY; } BOOL ecn2_compare(_MIPD_ ecn2 *a,ecn2 *b) { #ifdef MR_OS_THREADS miracl *mr_mip=get_mip(); #endif if (mr_mip->ERNUM) return FALSE; MR_IN(193) ecn2_norm(_MIPP_ a); ecn2_norm(_MIPP_ b); MR_OUT if (zzn2_compare(&(a->x),&(b->x)) && zzn2_compare(&(a->y),&(b->y)) && a->marker==b->marker) return TRUE; return FALSE; } void ecn2_norm(_MIPD_ ecn2 *a) { zzn2 t; #ifdef MR_OS_THREADS miracl *mr_mip=get_mip(); #endif #ifndef MR_AFFINE_ONLY if (mr_mip->ERNUM) return; if (a->marker!=MR_EPOINT_GENERAL) return; MR_IN(194) zzn2_inv(_MIPP_ &(a->z)); t.a=mr_mip->w3; t.b=mr_mip->w4; zzn2_copy(&(a->z),&t); zzn2_sqr(_MIPP_ &(a->z),&(a->z)); zzn2_mul(_MIPP_ &(a->x),&(a->z),&(a->x)); zzn2_mul(_MIPP_ &(a->z),&t,&(a->z)); zzn2_mul(_MIPP_ &(a->y),&(a->z),&(a->y)); zzn2_from_zzn(mr_mip->one,&(a->z)); a->marker=MR_EPOINT_NORMALIZED; MR_OUT #endif } void ecn2_get(_MIPD_ ecn2 *e,zzn2 *x,zzn2 *y,zzn2 *z) { #ifdef MR_OS_THREADS miracl *mr_mip=get_mip(); #endif zzn2_copy(&(e->x),x); zzn2_copy(&(e->y),y); #ifndef MR_AFFINE_ONLY if (e->marker==MR_EPOINT_GENERAL) zzn2_copy(&(e->z),z); else zzn2_from_zzn(mr_mip->one,z); #endif } void ecn2_getxy(ecn2 *e,zzn2 *x,zzn2 *y) { zzn2_copy(&(e->x),x); zzn2_copy(&(e->y),y); } void ecn2_getx(ecn2 *e,zzn2 *x) { zzn2_copy(&(e->x),x); } void ecn2_psi(_MIPD_ zzn2 *psi,ecn2 *P) { /* apply GLS morphism to P */ #ifdef MR_OS_THREADS miracl *mr_mip=get_mip(); #endif MR_IN(212) ecn2_norm(_MIPP_ P); zzn2_conj(_MIPP_ &(P->x),&(P->x)); zzn2_conj(_MIPP_ &(P->y),&(P->y)); zzn2_mul(_MIPP_ &(P->x),&psi[0],&(P->x)); zzn2_mul(_MIPP_ &(P->y),&psi[1],&(P->y)); MR_OUT } #ifndef MR_AFFINE_ONLY void ecn2_getz(_MIPD_ ecn2 *e,zzn2 *z) { #ifdef MR_OS_THREADS miracl *mr_mip=get_mip(); #endif if (e->marker==MR_EPOINT_GENERAL) zzn2_copy(&(e->z),z); else zzn2_from_zzn(mr_mip->one,z); } #endif void ecn2_rhs(_MIPD_ zzn2 *x,zzn2 *rhs) { /* calculate RHS of elliptic curve equation */ int twist; zzn2 A,B; #ifdef MR_OS_THREADS miracl *mr_mip=get_mip(); #endif if (mr_mip->ERNUM) return; twist=mr_mip->TWIST; MR_IN(202) A.a=mr_mip->w10; A.b=mr_mip->w11; B.a=mr_mip->w12; B.b=mr_mip->w13; if (mr_abs(mr_mip->Asize)<MR_TOOBIG) zzn2_from_int(_MIPP_ mr_mip->Asize,&A); else zzn2_from_zzn(mr_mip->A,&A); if (mr_abs(mr_mip->Bsize)<MR_TOOBIG) zzn2_from_int(_MIPP_ mr_mip->Bsize,&B); else zzn2_from_zzn(mr_mip->B,&B); if (twist) { /* assume its the quartic or sextic twist, if such is possible */ if (twist==MR_QUARTIC_M) { zzn2_mul(_MIPP_ &A,x,&B); zzn2_txx(_MIPP_ &B); } if (twist==MR_QUARTIC_D) { zzn2_mul(_MIPP_ &A,x,&B); zzn2_txd(_MIPP_ &B); } if (twist==MR_SEXTIC_M) { zzn2_txx(_MIPP_ &B); } if (twist==MR_SEXTIC_D) { zzn2_txd(_MIPP_ &B); } if (twist==MR_QUADRATIC) { zzn2_txx(_MIPP_ &B); zzn2_txx(_MIPP_ &B); zzn2_txx(_MIPP_ &B); zzn2_mul(_MIPP_ &A,x,&A); zzn2_txx(_MIPP_ &A); zzn2_txx(_MIPP_ &A); zzn2_add(_MIPP_ &B,&A,&B); } /* if (mr_mip->Asize==0 || mr_mip->Bsize==0) { if (mr_mip->Asize==0) { // CM Discriminant D=3 - its the sextic twist (Hope I got the right one!). This works for BN curves zzn2_txd(_MIPP_ &B); } if (mr_mip->Bsize==0) { // CM Discriminant D=1 - its the quartic twist. zzn2_mul(_MIPP_ &A,x,&B); zzn2_txx(_MIPP_ &B); } } else { // its the quadratic twist zzn2_txx(_MIPP_ &B); zzn2_txx(_MIPP_ &B); zzn2_txx(_MIPP_ &B); zzn2_mul(_MIPP_ &A,x,&A); zzn2_txx(_MIPP_ &A); zzn2_txx(_MIPP_ &A); zzn2_add(_MIPP_ &B,&A,&B); } */ } else { zzn2_mul(_MIPP_ &A,x,&A); zzn2_add(_MIPP_ &B,&A,&B); } zzn2_sqr(_MIPP_ x,&A); zzn2_mul(_MIPP_ &A,x,&A); zzn2_add(_MIPP_ &B,&A,rhs); MR_OUT } BOOL ecn2_set(_MIPD_ zzn2 *x,zzn2 *y,ecn2 *e) { zzn2 lhs,rhs; #ifdef MR_OS_THREADS miracl *mr_mip=get_mip(); #endif if (mr_mip->ERNUM) return FALSE; MR_IN(195) lhs.a=mr_mip->w10; lhs.b=mr_mip->w11; rhs.a=mr_mip->w12; rhs.b=mr_mip-