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

    p = BigInteger.probablePrime(bitlength, random);
    // Use Random number to find a generator
    while (true) {
      BigInteger pg = BigInteger.probablePrime(bitlength, random).mod(p);
      if (!pg.equals(BigInteger.ONE)
          && !pg.modPow(BigInteger.valueOf(2), p).equals(
              BigInteger.ONE)
          && !pg.modPow(
              p.subtract(BigInteger.ONE).divide(
                  BigInteger.valueOf(2)), p).equals(
              BigInteger.ONE)) {

View Full Code Here

Examples of java.math.BigInteger.modPow()

    while (true) {
      BigInteger pg = BigInteger.probablePrime(bitlength, random).mod(p);
      if (!pg.equals(BigInteger.ONE)
          && !pg.modPow(BigInteger.valueOf(2), p).equals(
              BigInteger.ONE)
          && !pg.modPow(
              p.subtract(BigInteger.ONE).divide(
                  BigInteger.valueOf(2)), p).equals(
              BigInteger.ONE)) {
        g = pg;
        break;

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

        //
        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 (length<maxLength) {
          buf = new byte[length];
        }
        System.arraycopy(bytes, i*maxLength, buf, 0, length);
        BigInteger bi = new BigInteger(addOneByte(buf));
        l.add(bi.modPow(_encKey.getPublicExponent(), _encKey.getModulus()).toByteArray());
      }
      
      baos = new ByteArrayOutputStream();
      oos = new ObjectOutputStream(baos);
      oos.writeObject(l);

View Full Code Here

Examples of java.math.BigInteger.modPow()

    {
      log.log(20, "ssh-rsa signature: rsa_block_len < 1");
      return false;
    }


    byte[] v = s.modPow(e, n).toByteArray();


    int startpos = 0;


    if ((v.length > 0) && (v[0] == 0x00))
      startpos++;

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.