List of modPow() Examples

Examples of modPow()

java.math.BigInteger.modPow()
Returns a BigInteger whose value is (this^exponent mod m). (Unlike {@code pow}, this method permits negative exponents.) @param exponent the exponent. @param m the modulus. @return this^exponent mod m @throws ArithmeticException {@code m <= 0} @see #modInverse
net.i2p.util.NativeBigInteger.modPow()

Examples of java.math.BigInteger.modPow()

      //
        for (;;)
        {
            g = new BigInteger(qLength, random);


            if (g.modPow(TWO, p).equals(ONE))
            {
                continue;
            }


            if (g.modPow(q, p).equals(ONE))

View Full Code Here

Examples of java.math.BigInteger.modPow()

            if (g.modPow(TWO, p).equals(ONE))
            {
                continue;
            }


            if (g.modPow(q, p).equals(ONE))
            {
                continue;
            }


            break;

View Full Code Here

Examples of java.math.BigInteger.modPow()

            if (h.compareTo(ONE) <= 0 || h.compareTo(p.subtract(ONE)) >= 0)
            {
                continue;
            }


            g = h.modPow(pMinusOneOverQ, p);
            if (g.compareTo(ONE) <= 0)
            {
                continue;
            }

View Full Code Here

Examples of java.math.BigInteger.modPow()

      //
        for (;;)
        {
            g = new BigInteger(qLength, random);


            if (g.modPow(TWO, p).equals(ONE))
            {
                continue;
            }


            if (g.modPow(q, p).equals(ONE))

View Full Code Here

Examples of java.math.BigInteger.modPow()

            if (g.modPow(TWO, p).equals(ONE))
            {
                continue;
            }


            if (g.modPow(q, p).equals(ONE))
            {
                continue;
            }


            break;

View Full Code Here

Examples of java.math.BigInteger.modPow()

      BigInteger h = new BigInteger(size, random);
      if (h.compareTo(ONE) <= 0 || h.compareTo(p.subtract(ONE)) >= 0) {
        continue;
      }


      g = h.modPow(pMinusOneOverQ, p);
      if (g.compareTo(ONE) <= 0) {
        continue;
      }


      break;

View Full Code Here

Examples of java.math.BigInteger.modPow()

         */
        do
        {
            BigInteger h = BigIntegers.createRandomInRange(TWO, pMinusTwo, random);


            g = h.modPow(TWO, p);
        }
        while (g.equals(ONE));




        return g;

View Full Code Here

Examples of java.math.BigInteger.modPow()

        System.out.println("Public parameters for the cyclic group:");
        System.out.println("p (" + p.bitLength() + " bits): " + p.toString(16));
        System.out.println("q (" + q.bitLength() + " bits): " + q.toString(16));
        System.out.println("g (" + p.bitLength() + " bits): " + g.toString(16));
        System.out.println("p mod q = " + p.mod(q).toString(16));
        System.out.println("g^{q} mod p = " + g.modPow(q, p).toString(16));
        System.out.println("");


        System.out.println("(Secret passwords used by Alice and Bob: " +
                "\"" + alicePassword + "\" and \"" + bobPassword + "\")\n");

View Full Code Here

Examples of java.math.BigInteger.modPow()

            v = ONE;
            for (long i = 0; i < t - 1; i++)
            {
                v = v.shiftLeft(1); // v = 1 * 2^(t - 1)
            }
            c = c.modPow(v, p); // c = c^v mod p
            r = r.multiply(c).remainder(p); // r = r * c % p
            c = c.multiply(c).remainder(p); // c = c^2 % p
            n = n.multiply(c).mod(p); // n = n * c % p
        }
        return r;

View Full Code Here

Examples of java.math.BigInteger.modPow()

            if (h.compareTo(ONE) <= 0 || h.compareTo(p.subtract(ONE)) >= 0)
            {
                continue;
            }


            g = h.modPow(pMinusOneOverQ, p);
            if (g.compareTo(ONE) <= 0)
            {
                continue;
            }

View Full Code Here

0 1 2 3 4

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.