⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 ecc_sys.c

📁 该压缩包中包括 tom的加密函数库及pdf说明 ,以及Rinick s ECC:椭圆曲线非对称加密密钥生成器
💻 C
📖 第 1 页 / 共 2 页
字号:
   Verify an ECC signature   @param sig         The signature to verify   @param siglen      The length of the signature (octets)   @param hash        The hash (message digest) that was signed   @param hashlen     The length of the hash (octets)   @param stat        Result of signature, 1==valid, 0==invalid   @param key         The corresponding public ECC key   @return CRYPT_OK if successful (even if the signature is not valid)*/int ecc_verify_hash(const unsigned char *sig,  unsigned long siglen,                    const unsigned char *hash, unsigned long hashlen,                     int *stat, ecc_key *key){   ecc_point    *mG, *mQ;   mp_int        r, s, v, w, u1, u2, e, p, m;   mp_digit      mp;   int           err;   LTC_ARGCHK(sig  != NULL);   LTC_ARGCHK(hash != NULL);   LTC_ARGCHK(stat != NULL);   LTC_ARGCHK(key  != NULL);   /* default to invalid signature */   *stat = 0;   /* is the IDX valid ?  */   if (is_valid_idx(key->idx) != 1) {      return CRYPT_PK_INVALID_TYPE;   }   /* allocate ints */   if ((err = mp_init_multi(&r, &s, &v, &w, &u1, &u2, &p, &e, &m, NULL)) != MP_OKAY) {      return CRYPT_MEM;   }   /* allocate points */   mG = ecc_new_point();   mQ = ecc_new_point();   if (mQ  == NULL || mG == NULL) {      err = CRYPT_MEM;      goto done;   }   /* parse header */   if ((err = der_decode_sequence_multi(sig, siglen,                                  LTC_ASN1_INTEGER, 1UL, &r,                                  LTC_ASN1_INTEGER, 1UL, &s,                                  LTC_ASN1_EOL, 0UL, NULL)) != CRYPT_OK) {      goto done;   }   /* get the order */   if ((err = mp_read_radix(&p, (char *)ecc_sets[key->idx].order, 64)) != MP_OKAY)                  { goto error; }   /* get the modulus */   if ((err = mp_read_radix(&m, (char *)ecc_sets[key->idx].prime, 64)) != MP_OKAY)                  { goto error; }   /* check for zero */   if (mp_iszero(&r) || mp_iszero(&s) || mp_cmp(&r, &p) != MP_LT || mp_cmp(&s, &p) != MP_LT) {      err = CRYPT_INVALID_PACKET;      goto done;   }   /* read hash */   if ((err = mp_read_unsigned_bin(&e, (unsigned char *)hash, (int)hashlen)) != MP_OKAY)        { goto error; }   /*  w  = s^-1 mod n */   if ((err = mp_invmod(&s, &p, &w)) != MP_OKAY)                                                { goto error; }   /* u1 = ew */   if ((err = mp_mulmod(&e, &w, &p, &u1)) != MP_OKAY)                                           { goto error; }   /* u2 = rw */   if ((err = mp_mulmod(&r, &w, &p, &u2)) != MP_OKAY)                                           { goto error; }   /* find mG = u1*G */   if ((err = mp_read_radix(&mG->x, (char *)ecc_sets[key->idx].Gx, 64)) != MP_OKAY)                 { goto error; }   if ((err = mp_read_radix(&mG->y, (char *)ecc_sets[key->idx].Gy, 64)) != MP_OKAY)                 { goto error; }   mp_set(&mG->z, 1);     if ((err = ecc_mulmod(&u1, mG, mG, &m, 0)) != CRYPT_OK)                                      { goto done; }   /* find mQ = u2*Q */   if ((err = mp_copy(&key->pubkey.x, &mQ->x)) != MP_OKAY)                                      { goto error; }   if ((err = mp_copy(&key->pubkey.y, &mQ->y)) != MP_OKAY)                                      { goto error; }   if ((err = mp_copy(&key->pubkey.z, &mQ->z)) != MP_OKAY)                                      { goto error; }   if ((err = ecc_mulmod(&u2, mQ, mQ, &m, 0)) != CRYPT_OK)                                      { goto done; }     /* find the montgomery mp */   if ((err = mp_montgomery_setup(&m, &mp)) != MP_OKAY)                                         { goto error; }   /* add them */   if ((err = ecc_add(mQ, mG, mG, &m, mp)) != CRYPT_OK)                                       { goto done; }      /* reduce */   if ((err = ecc_map(mG, &m, mp)) != CRYPT_OK)                                                 { goto done; }   /* v = X_x1 mod n */   if ((err = mp_mod(&mG->x, &p, &v)) != MP_OKAY)                                              { goto error; }   /* does v == r */   if (mp_cmp(&v, &r) == MP_EQ) {      *stat = 1;   }   /* clear up and return */   err = CRYPT_OK;   goto done;error:   err = mpi_to_ltc_error(err);done:   ecc_del(mG);   ecc_del(mQ);   mp_clear_multi(&r, &s, &v, &w, &u1, &u2, &p, &e, &m, NULL);   return err;}/**	Rinick's 	Encrypt a message digest  @param in        The message digest to encrypt  @param inlen     The length of the digest  @param out       [out] The destination for the ciphertext  @param outlen    [in/out] The max size and resulting size of the ciphertext  @param prng      An active PRNG state  @param wprng     The index of the PRNG you wish to use  @param key       A private ECC key  @return CRYPT_OK if successful*/int ecc_private_encrypt(const unsigned char *in,  unsigned long inlen,                         unsigned char *out, unsigned long *outlen,                         prng_state *prng, int wprng, ecc_key *key){   ecc_key       pubkey;   mp_int        r, s, e, p;   int           err;   LTC_ARGCHK(in     != NULL);   LTC_ARGCHK(out    != NULL);   LTC_ARGCHK(outlen != NULL);   LTC_ARGCHK(key    != NULL);   /* is this a private key? */   if (key->type != PK_PRIVATE) {      return CRYPT_PK_NOT_PRIVATE;   }      /* is the IDX valid ?  */   if (is_valid_idx(key->idx) != 1) {      return CRYPT_PK_INVALID_TYPE;   }      if ((err = prng_is_valid(wprng)) != CRYPT_OK) {      return err;   }   /* get the hash and load it as a bignum into 'e' */   /* init the bignums */   if ((err = mp_init_multi(&r, &s, &p, &e, NULL)) != MP_OKAY) {       ecc_free(&pubkey);      err = mpi_to_ltc_error(err);      goto LBL_ERR;   }   if ((err = mp_read_radix(&p, (char *)ecc_sets[key->idx].order, 64)) != MP_OKAY)        { goto error; }   if ((err = mp_read_unsigned_bin(&e, (unsigned char *)in, (int)inlen)) != MP_OKAY)  { goto error; }   /* make up a key and export the public copy */   for (;;) {      if ((err = ecc_make_key(prng, wprng, ecc_get_size(key), &pubkey)) != CRYPT_OK) {         return err;      }      /* find r = x1-e mod n */      if ((err = mp_mod(&pubkey.pubkey.x, &p, &r)) != MP_OKAY)                           { goto error; }			if ((err = mp_submod(&r, &e, &p, &r)) != MP_OKAY)                           										{ goto error; }				      if (mp_iszero(&r)) {         ecc_free(&pubkey);      } else {         /* find s = (1 + xr)/k */        if ((err = mp_invmod(&pubkey.k, &p, &pubkey.k)) != MP_OKAY)            { goto error; } /* k = 1/k */        if ((err = mp_mulmod(&key->k, &r, &p, &s)) != MP_OKAY)                 { goto error; } /* s = xr */        if ((err = mp_add_d(&s, 1, &s)) != MP_OKAY)                 							{ goto error; }/* s = 1 +  xr */        if ((err = mp_mod(&s, &p, &s)) != MP_OKAY)                 							{ goto error; }/* s (mod p) */	         if ((err = mp_mulmod(&s, &pubkey.k, &p, &s)) != MP_OKAY)               { goto error; } /* s = (1 + xr)/k */        if (mp_iszero(&s)) {           ecc_free(&pubkey);        } else {           break;        }      }   }   /* store as SEQUENCE { r, s -- integer } */   err = der_encode_sequence_multi(out, outlen,                             LTC_ASN1_INTEGER, 1UL, &r,                             LTC_ASN1_INTEGER, 1UL, &s,                             LTC_ASN1_EOL, 0UL, NULL);   goto LBL_ERR;error:   err = mpi_to_ltc_error(err);LBL_ERR:   mp_clear_multi(&r, &s, &p, &e, NULL);   ecc_free(&pubkey);   return err;   }/* verify  * * w  = s^-1 mod n * u1 = w  * u2 = rw * X = u1*G + u2*Q * v = X_x1 mod n * output e = v - r *//**	Rinick's   Decrypt a ciphertext   @param in         The ciphertext to verify   @param siglen      The length of the ciphertext (octets)  @param out       [out] The destination for the message  @param outlen    [in/out] The max size and resulting size of the message   @param key         The corresponding public ECC key   @return CRYPT_OK if successful (even if the signature is not valid)*/int ecc_public_decrypt(const unsigned char *in,  unsigned long inlen,                    unsigned char *out, unsigned long *outlen,                       ecc_key *key){   ecc_point    *mG, *mQ;   mp_int        r, s, v, w, u1, u2, e, p, m;   mp_digit      mp;   int           err;   LTC_ARGCHK(in  != NULL);   LTC_ARGCHK(out != NULL);   LTC_ARGCHK(outlen != NULL);   LTC_ARGCHK(key != NULL);   /* is the IDX valid ?  */   if (is_valid_idx(key->idx) != 1) {      return CRYPT_PK_INVALID_TYPE;   }   /* allocate ints */   if ((err = mp_init_multi(&r, &s, &v, &w, &u1, &u2, &p, &e, &m, NULL)) != MP_OKAY) {      return CRYPT_MEM;   }   /* allocate points */   mG = ecc_new_point();   mQ = ecc_new_point();   if (mQ  == NULL || mG == NULL) {      err = CRYPT_MEM;      goto done;   }   /* parse header */   if ((err = der_decode_sequence_multi(in, inlen,                                  LTC_ASN1_INTEGER, 1UL, &r,                                  LTC_ASN1_INTEGER, 1UL, &s,                                  LTC_ASN1_EOL, 0UL, NULL)) != CRYPT_OK) {      goto done;   }   /* get the order */   if ((err = mp_read_radix(&p, (char *)ecc_sets[key->idx].order, 64)) != MP_OKAY)                  { goto error; }   /* get the modulus */   if ((err = mp_read_radix(&m, (char *)ecc_sets[key->idx].prime, 64)) != MP_OKAY)                  { goto error; }   /* check for zero */   if (mp_iszero(&r) || mp_iszero(&s) || mp_cmp(&r, &p) != MP_LT || mp_cmp(&s, &p) != MP_LT) {      err = CRYPT_INVALID_PACKET;      goto done;   }   /*  w  = s^-1 mod n */   if ((err = mp_invmod(&s, &p, &w)) != MP_OKAY)                                                { goto error; }   /* u1 = w */   if ((err = mp_copy(&w, &u1)) != MP_OKAY)                                           { goto error; }   /* u2 = rw */   if ((err = mp_mulmod(&r, &w, &p, &u2)) != MP_OKAY)                                           { goto error; }   /* find mG = u1*G */   if ((err = mp_read_radix(&mG->x, (char *)ecc_sets[key->idx].Gx, 64)) != MP_OKAY)                 { goto error; }   if ((err = mp_read_radix(&mG->y, (char *)ecc_sets[key->idx].Gy, 64)) != MP_OKAY)                 { goto error; }   mp_set(&mG->z, 1);     if ((err = ecc_mulmod(&u1, mG, mG, &m, 0)) != CRYPT_OK)                                      { goto done; }   /* find mQ = u2*Q */   if ((err = mp_copy(&key->pubkey.x, &mQ->x)) != MP_OKAY)                                      { goto error; }   if ((err = mp_copy(&key->pubkey.y, &mQ->y)) != MP_OKAY)                                      { goto error; }   if ((err = mp_copy(&key->pubkey.z, &mQ->z)) != MP_OKAY)                                      { goto error; }   if ((err = ecc_mulmod(&u2, mQ, mQ, &m, 0)) != CRYPT_OK)                                      { goto done; }     /* find the montgomery mp */   if ((err = mp_montgomery_setup(&m, &mp)) != MP_OKAY)                                         { goto error; }   /* add them */   if ((err = ecc_add(mQ, mG, mG, &m, mp)) != CRYPT_OK)                                       { goto done; }      /* reduce */   if ((err = ecc_map(mG, &m, mp)) != CRYPT_OK)                                                 { goto done; }   /* v = X_x1 mod n */   if ((err = mp_mod(&mG->x, &p, &v)) != MP_OKAY)                                              {  goto error; }   /* does e = v - r */   if ((err = mp_submod(&v, &r, &p, &e)) != MP_OKAY)                                            {  goto error; }   if ((err = mp_to_unsigned_bin_n (&e, out, outlen)) != MP_OKAY)                              {  goto error; }   /* clear up and return */   err = CRYPT_OK;   goto done;error:   err = mpi_to_ltc_error(err);done:   ecc_del(mG);   ecc_del(mQ);   mp_clear_multi(&r, &s, &v, &w, &u1, &u2, &p, &e, &m, NULL);   return err;}/* $Source: /cvs/libtom/libtomcrypt/src/pk/ecc/ecc_sys.c,v $ *//* $Revision: 1.18 $ *//* $Date: 2005/06/14 20:47:55 $ */

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -