java/math/BigInteger.java

264      * the number are larger than this value, {@code multiply(this)} will
1051             u2 = u.multiply(v).mod(n);
1053             v2 = v.square().add(d.multiply(u.square())).mod(n);
1066                 v2 = v.add(d.multiply(u)).mod(n);
1558     public BigInteger multiply(BigInteger val) {
1614      * Package private methods used by BigDecimal code to multiply a BigInteger
1617     BigInteger multiply(long v) {
1621             return multiply(BigInteger.valueOf(v));
1737         BigInteger p1 = xh.multiply(yh);  // p1 = xh*yh
1738         BigInteger p2 = xl.multiply(yl);  // p2 = xl*yl
1741         BigInteger p3 = xh.add(xl).multiply(yh.add(yl));
1805         v0 = a0.multiply(b0);
1808         vm1 = da1.subtract(a1).multiply(db1.subtract(b1));
1811         v1 = da1.multiply(db1);
1812         v2 = da1.add(a2).shiftLeft(1).subtract(a0).multiply(
1814         vinf = a2.multiply(b2);
2388             // the algorithm above, but calls multiply() and square()
2396                     answer = answer.multiply(partToSquare);
2673                 result = a1.multiply(m2).multiply(y1).add(a2.multiply(m1).multiply(y2)).mod(m);
2676                 new MutableBigInteger(a1.multiply(m2)).multiply(new MutableBigInteger(y1), t1);
2678                 new MutableBigInteger(a2.multiply(m1)).multiply(new MutableBigInteger(y2), t2);
2775      * To append   1: square, multiply by n^1
2776      * To append  10: square, multiply by n^1, square
2777      * To append  11: square, square, multiply by n^3
2778      * To append 100: square, multiply by n^1, square, square
2779      * To append 101: square, square, square, multiply by n^5
2780      * To append 110: square, square, multiply by n^3, square
2781      * To append 111: square, square, square, multiply by n^7
2783      * Since each pattern involves only one multiply, the longer the pattern
2786      * multiply k bits of exponent at a time.  Actually, assuming random
2788      * multiply (1/2 of the time there's none, 1/4 of the time there's 1,
2790      * you have to do one multiply per k+1 bits of exponent.
2797      * (buf & tblmask) != 0, we have to decide what pattern to multiply
2800      * of "100" in the buffer requires that we multiply by n^1 immediately;
2963             // Perform multiply
3141                 result = result.multiply(baseToPow2).mod2(p);