Searched defs:bnP (Results 1 - 4 of 4) sorted by relevance

/external/tpm2/
H A DMathFunctions.c221 BIGNUM *bnP; local
237 bnP = BN_CTX_get(context);
238 if (bnP == NULL)
246 if (BN_mul(bnP, bnA, bnB, context) != 1)
250 retVal = BN_num_bytes(bnP);
253 BN_bn2bin(bnP, &p[aSize + bSize - retVal]);
259 BN_bn2bin(bnP, p);
H A DCpriRSA.c40 BIGNUM *bnP; local
55 bnP = BN_CTX_get(context);
64 || BN_bin2bn(key->privateKey->buffer, key->privateKey->size, bnP) == NULL)
70 if(BN_num_bits(bnP) < BN_num_bits(bnN)/2)
76 if (BN_div(bnQ, bnQr, bnN, bnP, context) != 1)
79 if(BN_num_bytes(bnQr) != 0 || BN_num_bits(bnQ) != BN_num_bits(bnP))
86 || !BN_sub(bnPhi, bnPhi, bnP)
145 BIGNUM *bnP; local
166 bnP = BN_CTX_get(context); // prime1 (p)
172 if(BN_bin2bn(prime1->buffer, prime1->size, bnP)
1195 BIGNUM *bnP; local
[all...]
H A DRSAKeySieve.c563 BIGNUM *bnP, // IN/OUT: The candidate to filter
578 UINT32 rounds = MillerRabinRounds(BN_num_bits(bnP));
584 primes = BN_num_bits(bnP);
606 first = bnP->d[0] | 0x80000000;
608 bnP->d[0] &= ~((UINT32)(fieldSize-3));
609 pAssert(BN_is_bit_set(bnP, 0));
610 bnP->d[0] &= (UINT32_MAX << (FIELD_POWER + 1)) + 1;
611 ones = PrimeSieve(bnP, fieldSize, field, primes);
628 BN_add_word(bnP, chosen * 2);
630 if(MillerRabin(bnP, round
562 PrimeSelectWithSieve( BIGNUM *bnP, KDFa_CONTEXT *ktx, UINT32 e, BN_CTX *context ,UINT16 fieldSize, UINT16 primes ) argument
689 BIGNUM *bnP; local
801 BIGNUM *bnP; local
[all...]
H A DCpriECC.c151 BIGNUM *bnP; local
165 bnP = BN_CTX_get(context);
175 BnFrom2B(bnP, curveData->p);
184 ok = ( (group = EC_GROUP_new_curve_GFp(bnP, bnA, bnB, groupContext)) != NULL
600 BIGNUM *bnP; local
613 bnP = BN_CTX_get(context);
614 if(bnP == NULL)
619 || !BN_bin2bn(curveData->p->buffer, curveData->p->size, bnP)
628 if( !BN_mod_mul(bnA, bnA, bnX, bnP, context)
631 || !BN_mod_add(bnA, bnA, bnB, bnP, contex
[all...]

Completed in 137 milliseconds