Lines Matching defs:multiply
845 u2 = u.multiply(v).mod(n);
847 v2 = v.square().add(d.multiply(u.square())).mod(n);
860 v2 = v.add(d.multiply(u)).mod(n);
1165 public BigInteger multiply(BigInteger val) {
1176 * Package private methods used by BigDecimal code to multiply a BigInteger
1179 BigInteger multiply(long v) {
1183 return multiply(BigInteger.valueOf(v));
1628 result = a1.multiply(m2).multiply(y1).add
1629 (a2.multiply(m1).multiply(y2)).mod(m);
1651 * To append 1: square, multiply by n^1
1652 * To append 10: square, multiply by n^1, square
1653 * To append 11: square, square, multiply by n^3
1654 * To append 100: square, multiply by n^1, square, square
1655 * To append 101: square, square, square, multiply by n^5
1656 * To append 110: square, square, multiply by n^3, square
1657 * To append 111: square, square, square, multiply by n^7
1659 * Since each pattern involves only one multiply, the longer the pattern
1662 * multiply k bits of exponent at a time. Actually, assuming random
1664 * multiply (1/2 of the time there's none, 1/4 of the time there's 1,
1666 * you have to do one multiply per k+1 bits of exponent.
1673 * (buf & tblmask) != 0, we have to decide what pattern to multiply
1676 * of "100" in the buffer requires that we multiply by n^1 immediately;
1829 // Perform multiply
1985 result = result.multiply(baseToPow2).mod2(p);