Lines Matching refs:x

38 function am1(i, x, w, j, c, n) {  argument
40 var v = x * this[i++] + w[j] + c;
49 function am2(i, x, w, j, c, n) { argument
50 var xl = x & 0x7fff, xh = x >> 15;
63 function am3(i, x, w, j, c, n) { argument
64 var xl = x & 0x3fff, xh = x >> 14;
126 function bnpFromInt(x) { argument
128 this.s = (x < 0) ? -1 : 0;
129 if (x > 0)
130 this[0] = x;
131 else if (x < -1)
132 this[0] = x + DV;
167 var x = (k == 8) ? s[i] & 0xff : intAt(s, i);
168 if (x < 0) {
175 this[this.t++] = x;
177 this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;
178 this[this.t++] = (x >> (this.DB - sh));
180 this[this.t - 1] |= x << sh;
274 function nbits(x) { argument
276 if ((t = x >>> 16) != 0) {
277 x = t;
280 if ((t = x >> 8) != 0) {
281 x = t;
284 if ((t = x >> 4) != 0) {
285 x = t;
288 if ((t = x >> 2) != 0) {
289 x = t;
292 if ((t = x >> 1) != 0) {
293 x = t;
403 var x = this.abs(), y = a.abs();
404 var i = x.t;
409 r[i + x.t] = x.am(0, y[i], r, i, 0, x.t);
418 var x = this.abs();
419 var i = r.t = 2 * x.t;
422 for (i = 0; i < x.t - 1; ++i) {
423 var c = x.am(i, x[i], r, 2 * i, 0, 1);
424 if ((r[i + x.t] += x.am(i + 1, 2 * x[i], r, 2 * i + 1, c, x.t - i - 1)) >= x.DV) {
425 r[i + x.t] -= x.DV;
426 r[i + x.t + 1] = 1;
430 r[r.t - 1] += x.am(i, x[i], r, 2 * i, 0, 1);
513 function cConvert(x) { argument
514 if (x.s < 0 || x.compareTo(this.m) >= 0)
515 return x.mod(this.m);
517 return x;
519 function cRevert(x) { argument
520 return x;
522 function cReduce(x) { argument
523 x.divRemTo(this.m, null, x);
525 function cMulTo(x, y, r) { argument
526 x.multiplyTo(y, r);
529 function cSqrTo(x, r) { argument
530 x.squareTo(r);
553 var x = this[0];
554 if ((x & 1) == 0)
556 var y = x & 3; // y == 1/x mod 2^2
557 y = (y * (2 - (x & 0xf) * y)) & 0xf; // y == 1/x mod 2^4
558 y = (y * (2 - (x & 0xff) * y)) & 0xff; // y == 1/x mod 2^8
559 y = (y * (2 - (((x & 0xffff) * y) & 0xffff))) & 0xffff; // y == 1/x mod 2^16
562 y = (y * (2 - x * y % this.DV)) % this.DV; // y == 1/x mod 2^dbits
578 function montConvert(x) { argument
580 x.abs().dlShiftTo(this.m.t, r);
582 if (x.s < 0 && r.compareTo(BigInteger.ZERO) > 0)
588 function montRevert(x) { argument
590 x.copyTo(r);
596 function montReduce(x) { argument
597 while (x.t <= this.mt2)
599 x[x.t++] = 0;
602 var j = x[i] & 0x7fff;
603 var u0 = (j * this.mpl + (((j * this.mph + (x[i] >> 15) * this.mpl) & this.um) << 15))
604 & x.DM;
607 x[j] += this.m.am(0, u0, x, i, 0, this.m.t);
609 while (x[j] >= x.DV) {
610 x[j] -= x.DV;
611 x[++j]++;
614 x.clamp();
615 x.drShiftTo(this.m.t, x);
616 if (x.compareTo(this.m) >= 0)
617 x.subTo(this.m, x);
621 function montSqrTo(x, r) { argument
622 x.squareTo(r);
627 function montMulTo(x, y, r) { argument
628 x.multiplyTo(y, r);
757 function rng_seed_int(x) { argument
758 rng_pool[rng_pptr++] ^= x & 255;
759 rng_pool[rng_pptr++] ^= (x >> 8) & 255;
760 rng_pool[rng_pptr++] ^= (x >> 16) & 255;
761 rng_pool[rng_pptr++] ^= (x >> 24) & 255;
854 var x = new Array();
856 x[0] = 0;
857 while (x[0] == 0)
858 rng.nextBytes(x);
859 ba[--n] = x[0];
888 function RSADoPublic(x) { argument
889 return x.modPowInt(this.e, this.n);