Searched refs:bitlen (Results 1 - 25 of 58) sorted by last modified time
123
| /macosx-10.10.1/Security-57031.1.35/Security/include/security_cryptkit/ |
| H A D | elliptic.c | 446 int len = bitlen(k);
986 len = bitlen(n);
1248 while(bitlen(x) > par->q) {
1312 while(bitlen(x) > par->q) {
1317 while(bitlen(t3) > par->q) {
1387 cp->minBytes = (bitlen(cp->basePrime) + 7) / 8;
|
| H A D | ellipticMeasure.h | 47 bitsInN = bitlen(n); \
|
| H A D | ellipticProj.c | 313 hlen = bitlen(t0);
314 klen = bitlen(k);
414 for(j = bitlen(n)-2; j >= 0; j--) {
449 len = bitlen(n);
|
| H A D | engineNSA127.c | 507 int len = bitlen(k), pos = len-2;
|
| H A D | feeFEED.c | 282 unsigned blen = bitlen(finst->cp->basePrime);
|
| H A D | feeFEEDExp.c | 128 unsigned blen = bitlen(finst->cp->basePrime);
|
| H A D | feePublicKey.c | 24 * Fixed feePubKeyBitsize bitlen bug for PT_GENERAL case.
722 return bitlen(pkinst->cp->basePrime);
836 privLen = (bitlen(corder) / 8) + 1;
|
| H A D | giantFFT.c | 59 (void)bitlen(b); // XXX
211 bitlen(gx); // XXX
241 bitlen(x); // XXX
|
| H A D | giantIntegers.c | 494 unsigned bitlen(giant n) { function
504 CKRaise("bitlen - no bit set!");
937 int diff = bitlen(u) - bitlen(v);
1210 while (bitlen(g) > n) {
1249 b = bitlen(g);
1398 (void)bitlen(b); // Assertion....
1566 int_to_giant(1, r); subg(r, d); b = bitlen(d); addg(r, d);
1601 int s = 2*(bitlen(r)-1), sign = gsign(n);
1649 int s = (bitlen(
[all...] |
| H A D | giantIntegers.h | 107 unsigned bitlen(giant n); /* Returns the bit-length n;
|
| /macosx-10.10.1/Security-57031.1.35/Security/libsecurity_cryptkit/ckutils/giantDvt/ |
| H A D | giantDvt.c | 256 int maxShift = bitlen(g1) - 1;
|
| /macosx-10.10.1/Security-57031.1.35/Security/libsecurity_cryptkit/lib/ |
| H A D | elliptic.c | 446 int len = bitlen(k);
986 len = bitlen(n);
1248 while(bitlen(x) > par->q) {
1312 while(bitlen(x) > par->q) {
1317 while(bitlen(t3) > par->q) {
1387 cp->minBytes = (bitlen(cp->basePrime) + 7) / 8;
|
| H A D | ellipticMeasure.h | 47 bitsInN = bitlen(n); \
|
| H A D | ellipticProj.c | 313 hlen = bitlen(t0);
314 klen = bitlen(k);
414 for(j = bitlen(n)-2; j >= 0; j--) {
449 len = bitlen(n);
|
| H A D | engineNSA127.c | 507 int len = bitlen(k), pos = len-2;
|
| H A D | feeFEED.c | 282 unsigned blen = bitlen(finst->cp->basePrime);
|
| H A D | feeFEEDExp.c | 128 unsigned blen = bitlen(finst->cp->basePrime);
|
| H A D | feePublicKey.c | 24 * Fixed feePubKeyBitsize bitlen bug for PT_GENERAL case.
722 return bitlen(pkinst->cp->basePrime);
836 privLen = (bitlen(corder) / 8) + 1;
|
| H A D | giantFFT.c | 59 (void)bitlen(b); // XXX
211 bitlen(gx); // XXX
241 bitlen(x); // XXX
|
| H A D | giantIntegers.c | 494 unsigned bitlen(giant n) { function
504 CKRaise("bitlen - no bit set!");
937 int diff = bitlen(u) - bitlen(v);
1210 while (bitlen(g) > n) {
1249 b = bitlen(g);
1398 (void)bitlen(b); // Assertion....
1566 int_to_giant(1, r); subg(r, d); b = bitlen(d); addg(r, d);
1601 int s = 2*(bitlen(r)-1), sign = gsign(n);
1649 int s = (bitlen(
[all...] |
| H A D | giantIntegers.h | 107 unsigned bitlen(giant n); /* Returns the bit-length n;
|
| /macosx-10.10.1/xnu-2782.1.97/bsd/netinet6/ |
| H A D | in6.c | 2906 int bytelen, bitlen; local
2915 bitlen = len % 8;
2919 if (bitlen != 0 &&
2920 p1->s6_addr[bytelen] >> (8 - bitlen) !=
2921 p2->s6_addr[bytelen] >> (8 - bitlen))
2933 int bytelen, bitlen, i; local
2943 bitlen = len % 8;
2946 if (bitlen)
2947 maskp->s6_addr[bytelen] = maskarray[bitlen - 1];
|
| /macosx-10.10.1/Security-57031.1.35/Security/include/security_cryptkit/CurveParamDocs/ |
| H A D | ellproj.c | 359 hlen = bitlen(t0);
360 klen = bitlen(k);
|
| H A D | factor.c | 391 q = bitlen(N) + 1;
722 if ((!isone(gg))&&(bitlen(gg)>limitbits))
814 if((!isone(gg))&&(bitlen(gg)>limitbits))
|
| H A D | fmodule.c | 118 mersennemod(bitlen(N), t);
121 fermatmod(bitlen(N)-1, t);
|
Completed in 281 milliseconds
123