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()

     */
    private BigInteger blindMessage(
        BigInteger msg)
    {
        BigInteger blindMsg = blindingFactor;
        blindMsg = msg.multiply(blindMsg.modPow(key.getExponent(), key.getModulus()));
        blindMsg = blindMsg.mod(key.getModulus());


        return blindMsg;
    }

View Full Code Here

Examples of java.math.BigInteger.modPow()

        // Handbook of Applied Cryptography 4.86
        do
        {
            g = createInRange(TWO, pMinusTwo, random);
        }
        while (g.modPow(TWO, p).equals(ONE)
            || g.modPow(q, p).equals(ONE));


/*
        // RFC 2631 2.1.1 (and see Handbook of Applied Cryptography 4.81)
        do

View Full Code Here

Examples of java.math.BigInteger.modPow()

        do
        {
            g = createInRange(TWO, pMinusTwo, random);
        }
        while (g.modPow(TWO, p).equals(ONE)
            || g.modPow(q, p).equals(ONE));


/*
        // RFC 2631 2.1.1 (and see Handbook of Applied Cryptography 4.81)
        do
        {

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()

                (d.compareTo(p.subtract(TWO))==1)) //  d < p-1
            {
                continue;
            }


            if (d.modPow(p.subtract(ONE).divide(q),p).compareTo(ONE)!=0)
            {
                return d.modPow(p.subtract(ONE).divide(q),p);
            }
        }
    }

View Full Code Here

Examples of java.math.BigInteger.modPow()

                continue;
            }


            if (d.modPow(p.subtract(ONE).divide(q),p).compareTo(ONE)!=0)
            {
                return d.modPow(p.subtract(ONE).divide(q),p);
            }
        }
    }


    /**

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()

            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.