Searched refs:exponent (Results 1 - 25 of 167) sorted by path

1234567

/macosx-10.10/CommonCrypto-60061/include/
H A DCommonRSACryptor.h424 @param exponent The raw data bytes of the exponent.
425 @param exponentLength The exponent data length. (in/out parameter)
436 CCRSAGetKeyComponents(CCRSACryptorRef rsaKey, uint8_t *modulus, size_t *modulusLength, uint8_t *exponent, size_t *exponentLength,
443 key from an exponent and Modulus.
449 @param exponent The raw data bytes of the exponent.
450 @param exponentLength The exponent data length.
464 CCRSACryptorCreateFromData( CCRSAKeyType keyType, uint8_t *modulus, size_t modulusLength, uint8_t *exponent, size_t exponentLength,
/macosx-10.10/CommonCrypto-60061/lib/
H A DCommonRSACryptor.c171 // ccrsa_generate_key() requires the exponent as length / pointer to bytes
517 uint8_t *exponent, size_t exponentLength,
533 __Require_Action(ccn_read_uint(n, ccrsa_ctx_e(rsaKey->fk), exponentLength, exponent) == 0, errOut, retval = kCCParamError);
579 CCRSAGetKeyComponents(CCRSACryptorRef rsaKey, uint8_t *modulus, size_t *modulusLength, uint8_t *exponent, size_t *exponentLength, argument
587 if(ccrsa_get_pubkey_components(ccrsa_ctx_public(rsaKey->fk), modulus, modulusLength, exponent, exponentLength)) return kCCParamError;
592 if(ccrsa_get_fullkey_components(rsaKey->fk, modulus, modulusLength, exponent, exponentLength,
516 CCRSACryptorCreateFromData( CCRSAKeyType keyType, uint8_t *modulus, size_t modulusLength, uint8_t *exponent, size_t exponentLength, uint8_t *p, size_t pLength, uint8_t *q, size_t qLength, CCRSACryptorRef *ref) argument
/macosx-10.10/CommonCrypto-60061/test/CommonCrypto/
H A DCommonRSA.c141 RSAStdGenTest(size_t keysize, uint32_t exponent)
146 ok((retval = CCRSACryptorGeneratePair(keysize, exponent, &publicKey, &privateKey)) == kCCSuccess, "Generated Key Pairs");
257 uint8_t *exponent = bytesFromDecStr(exponentStr, &exponent_size);
259 if(exponent && modulus) {
260 status = CCRSACryptorCreateFromData(ccRSAKeyPublic, modulus, modulus_size, exponent, exponent_size,
/macosx-10.10/Heimdal-398.1.2/lib/hcrypto/libtommath/
H A Dtommath.tex220 The basic IEEE \cite{IEEE} standard floating point type is made up of an integer mantissa $q$, an exponent $e$ and a sign bit $s$.
2864 $O \left ( k^{lg_n(2n - 1)} \right )$ for $k$ digit inputs (\textit{assuming they have the same number of digits}). Figure~\ref{fig:exponent}
2883 \label{fig:exponent}
2886 At first it may seem like a good idea to choose $n = 1000$ since the exponent is approximately $1.1$. However, the overhead
3708 exponent on the divisor when added to the amount $q_0$ was shifted by equals $2m$. If the optimization had not been performed the divisor
3709 would have the exponent $2m$ so in the end the exponents do ``add up''. Using the above equation the quotient
4716 are two trivial relationships between the base and the exponent. Let $b_i$ represent the $i$'th bit of $b$ starting from the least
4758 multiplied against the current product. In each iteration the product is squared which doubles the exponent of the individual terms of the
4781 called ``Left to Right'' because it reads the exponent in that order. All of the exponentiation algorithms that will be presented are of this nature.
4784 The first algorithm in the series of exponentiation algorithms will be an unbounded algorithm where the exponent i
[all...]
/macosx-10.10/Heimdal-398.1.2/lib/hx509/
H A Dsoftp11.c370 CK_BYTE *exponent = NULL; local
398 "rsa-exponent");
403 exponent = malloc(exponent_len);
404 BN_bn2bin(num, exponent);
408 exponent, exponent_len);
410 free(exponent);
/macosx-10.10/ICU-531.30/icuSources/common/
H A Dputilimp.h338 * Floating point utility to calculate d to the power of exponent (d^exponent).
341 U_INTERNAL double U_EXPORT2 uprv_pow(double d, double exponent);
343 * Floating point utility to calculate 10 to the power of exponent (10^exponent).
346 U_INTERNAL double U_EXPORT2 uprv_pow10(int32_t exponent);
H A Dualoc.cpp21 // Resultant integers are in the form -?xxyyyyyy, where xx is the exponent
28 // 9.99999) and instead offset the exponent by -55.
32 int32_t exponent = (intF / 1000000) - 55; local
33 return coefficient * uprv_pow10(exponent);
/macosx-10.10/ICU-531.30/icuSources/i18n/
H A DdecNumber.c60 /* precision (up to 999,999,999 digits) and arbitrary exponent */
69 /* be finite, positive, have an exponent of zero, and all digits */
71 /* which are 0 or 1 (and will have exponent=0 and a sign of 0). */
136 /* 4. Exponent checking is minimized by allowing the exponent to */
141 /* overflow (the most negative valid exponent is -1999999997, for */
142 /* a 999999999-digit number with adjusted exponent of -999999999). */
398 /* Invalid is set if the decNumber does not have exponent==0 or if */
406 /* special or too many digits, or bad exponent */
407 if (dn->bits&DECSPECIAL || dn->digits>10 || dn->exponent!=0) ; /* bad */
441 /* special or too many digits, or bad exponent, o
512 Int exponent=0; /* working exponent [assume 0] */ local
4281 Int exponent; /* working exponent */ local
4872 Int exponent; /* work */ local
[all...]
H A DdecNumber.h83 int32_t exponent; /* Unadjusted exponent, unbiased, in */ member in struct:__anon932
H A DdecNumberLocal.h152 #define DECNUMMAXE 999999999 /* maximum adjusted exponent ditto */
153 #define DECNUMMINE -999999999 /* minimum adjusted exponent ditto */
158 #error Maximum exponent mismatch
161 #error Minimum exponent mismatch
283 Int exponent; /* Unadjusted signed exponent (q), or */ member in struct:__anon933
287 /* Test if exponent or bcdnum exponent must be a special, etc. */
291 #define NUMISSPECIAL(num) (EXPISSPECIAL((num)->exponent))
341 /* DFISINT -- test for finite and exponent
[all...]
H A Ddecimfmt.cpp1870 // adjusting the exponent. For example, 0.01234 with 3 minimum
1875 // which the exponent is restricted to a multiple of 3. For
1881 int32_t exponent = digits.getDecimalAt();
1883 // A exponent increment is defined; adjust to it.
1884 exponent = (exponent > 0) ? (exponent - 1) / maxIntDig
1885 : (exponent / maxIntDig) - 1;
1886 exponent *= maxIntDig;
1888 // No exponent incremen
[all...]
H A Ddigitlst.cpp298 fDecNumber->exponent = d - adjustedDigits;
306 return fDecNumber->exponent; // Exponent should be zero for these cases.
308 return fDecNumber->exponent + fDecNumber->digits;
326 if (decNumberIsZero(fDecNumber) && fDecNumber->exponent==0) {
327 // The extra test for exponent==0 is needed because parsing sometimes appends
380 fDecNumber->exponent--; // To match the old digit list implementation.
392 // least signficant digit, we need to adjust the exponent.
393 fDecNumber->exponent--;
495 if (fDecNumber->digits + fDecNumber->exponent > 10) {
499 if (fDecNumber->exponent !
[all...]
H A Dnfrs.h88 // raise radix to the power exponent, only non-negative exponents
89 int64_t util64_pow(int32_t radix, uint32_t exponent);
H A Dnfrule.cpp35 , exponent(0)
133 && (rule1->baseValue % util64_pow(rule1->radix, rule1->exponent)) == 0)
170 // both rules have the same radix and exponent (i.e., the
173 rule2->exponent = rule1->exponent;
212 * exponent according to the descriptor. (If the description doesn't
320 // accordingly, and recalculate the rule's exponent
327 exponent = expectedExponent();
332 // decrement the exponent (unless the exponent i
[all...]
H A Dnfrule.h62 double getDivisor() const { return uprv_pow(radix, exponent); }
98 int16_t exponent; member in class:NFRule
H A Dnfsubs.cpp89 virtual void setDivisor(int32_t radix, int32_t exponent, UErrorCode& status) { argument
90 divisor = uprv_pow(radix, exponent);
141 virtual void setDivisor(int32_t radix, int32_t exponent, UErrorCode& status) { argument
142 divisor = uprv_pow(radix, exponent);
530 * @param exponent The exponent of the divisor
533 NFSubstitution::setDivisor(int32_t /*radix*/, int32_t /*exponent*/, UErrorCode& /*status*/) {
H A Dnfsubs.h91 * @param exponent The exponent of the divisor
93 virtual void setDivisor(int32_t radix, int32_t exponent, UErrorCode& status);
H A Dplurrule.cpp1554 int exponent = atoi(buf+18);
1562 numFractionDigits -= exponent; // Fraction part of fixed point representation.
/macosx-10.10/IOHIDFamily-606.1.7/IOHIDSystem/
H A DIOFixed64.cpp82 IOFixed64 exponent(const IOFixed64 original, const UInt8 power) function
146 IOFixed64 function_at_x = x * gains[0] + exponent(x * gains[1], 2);
150 function_at_x += exponent(x * gains[2], 3);
153 function_at_x += exponent(x * gains[3], 4);
162 IOFixed64 derivative_at_x = gains[0] + x * exponent(gains[1], 2) * 2LL;
166 derivative_at_x += exponent(x, 2) * exponent(gains[2], 3) * 3LL;
169 derivative_at_x += exponent(x, 3) * exponent(gains[3], 4) * 4LL;
H A DIOFixed64.h195 IOFixed64 exponent(const IOFixed64 original, const UInt8 power);
H A DIOHIPointing.cpp2066 secondaryParams.b_root = exponent(secondaryParams.y1, 2) - secondaryParams.m_root * primaryParams.tangent[1];
/macosx-10.10/JavaScriptCore-7600.1.17/runtime/
H A DBigInteger.h42 int32_t exponent; local
44 decomposeDouble(number, sign, exponent, mantissa);
45 ASSERT(!sign && exponent >= 0);
47 int32_t zeroBits = exponent - 52;
64 // Shift based on the remainder of the exponent.
H A DUint16WithFraction.h58 int32_t exponent; local
60 decomposeDouble(number - integerPart, sign, exponent, mantissa);
61 ASSERT(!sign && exponent < 0);
62 exponent -= divideByExponent;
64 int32_t zeroBits = -exponent;
78 // Shift based on the remainder of the exponent.
258 // the units column, 32 for zeros introduced due to an exponent up to -3FE, and 2 for
/macosx-10.10/Libc-1044.1.2/stdio/FreeBSD/
H A Dprintfcommon.h53 static int exponent(CHAR *, int, CHAR);
266 exponent(CHAR *p0, int exp, CHAR fmtch) function
H A Dxprintf_float.c88 exponent(char *p0, int expo, int fmtch) function
155 * D: expchar holds this character; '\0' if no exponent, e.g. %f
164 char expchar; /* exponent character: [eEpP\0] */
166 int expt; /* integer value of exponent */
173 char expstr[MAXEXPDIG+2]; /* buffer for exponent string: e+ZZZ */
314 expsize = exponent(expstr, expt - 1, expchar);

Completed in 345 milliseconds

1234567