HomeSort by relevance Sort by last modified time
    Searched refs:bitLength (Results 1 - 25 of 73) sorted by null

1 2 3

  /external/bouncycastle/src/main/java/org/bouncycastle/crypto/params/
DSAKeyGenerationParameters.java 16 super(random, params.getP().bitLength() - 1);
ECKeyGenerationParameters.java 16 super(random, domainParams.getN().bitLength());
DHKeyGenerationParameters.java 28 return params.getL() != 0 ? params.getL() : params.getP().bitLength();
  /external/bouncycastle/src/main/java/org/bouncycastle/util/
BigIntegers.java 61 if (min.bitLength() > max.bitLength() / 2)
68 BigInteger x = new BigInteger(max.bitLength(), random);
76 return new BigInteger(max.subtract(min).bitLength() - 1, random).add(min);
  /libcore/luni/src/main/java/java/security/spec/
ECFieldFp.java 56 return p.bitLength();
EllipticCurve.java 92 if (!(this.a.bitLength() <= fieldSizeInBits)) {
95 if (!(this.b.bitLength() <= fieldSizeInBits)) {
  /external/bouncycastle/src/main/java/org/bouncycastle/crypto/digests/
GeneralDigest.java 97 long bitLength = (byteCount << 3);
109 processLength(bitLength);
132 protected abstract void processLength(long bitLength);
  /libcore/luni/src/main/java/java/math/
BigDecimal.java 191 LONG_FIVE_POW_BIT_LENGTH[i] = bitLength(LONG_FIVE_POW[i]);
194 LONG_POWERS_OF_TEN_BIT_LENGTH[i] = bitLength(MathUtils.LONG_POWERS_OF_TEN[i]);
223 private transient int bitLength;
246 this.bitLength = bitLength(smallValue);
252 this.bitLength = bitLength(smallValue);
351 bitLength = bitLength(smallValue);
505 int mantissaBits = bitLength(mantissa)
    [all...]
BigInteger.java 149 * pow(2, bitLength)-1]} which is probably prime. The probability that the
157 * @param bitLength length of the new {@code BigInteger} in bits.
159 * @throws ArithmeticException if {@code bitLength < 2}.
163 public BigInteger(int bitLength, int certainty, Random unused) {
164 if (bitLength < 2) {
165 throw new ArithmeticException("bitLength < 2: " + bitLength);
167 setBigInt(BigInt.generatePrimeDefault(bitLength));
476 * {@code bitLength() + 1} bits long.
478 * <p>The value will fit into an {@code int} if {@code bitLength() < 32} o
    [all...]
BigInt.java 255 int actualByteCount = (NativeBN.bitLength(this.bignum) + 7) / 8;
259 int bitLength() {
260 return NativeBN.bitLength(this.bignum);
381 static BigInt generatePrimeDefault(int bitLength) {
383 Check(NativeBN.BN_generate_prime_ex(r.bignum, bitLength, false, 0, 0, 0));
NativeBN.java 86 public static native int bitLength(int a);
  /system/core/libmincrypt/tools/
DumpPublicKey.java 47 if (modulus.bitLength() != 2048)
49 modulus.bitLength() + " bits.");
63 int nwords = N.bitLength() / 32; // # of 32 bit integers in modulus
74 BigInteger R = BigInteger.valueOf(2).pow(N.bitLength());
  /external/bouncycastle/src/main/java/org/bouncycastle/math/ec/
ECAlgorithms.java 62 int m = Math.max(k.bitLength(), l.bitLength());
FpNafMultiplier.java 24 for (int i = h.bitLength() - 2; i > 0; --i)
WNafMultiplier.java 31 byte[] wnaf = new byte[k.bitLength() + 1];
105 int m = k.bitLength();
  /external/bouncycastle/src/main/java/org/bouncycastle/crypto/signers/
ECDSASigner.java 71 int nBitLength = n.bitLength();
147 if (n.bitLength() > message.length * 8)
156 if (messageBitLength - n.bitLength() > 0)
158 trunc = trunc.shiftRight(messageBitLength - n.bitLength());
DSASigner.java 63 int qBitLength = params.getQ().bitLength();
125 if (n.bitLength() >= message.length * 8)
131 byte[] trunc = new byte[n.bitLength() / 8];
  /external/bouncycastle/src/main/java/org/bouncycastle/crypto/generators/
RSAKeyPairGenerator.java 80 if (q.subtract(p).abs().bitLength() < mindiffbits)
106 if (n.bitLength() == param.getStrength())
ECKeyPairGenerator.java 38 int nBitLength = n.bitLength();
  /external/apache-harmony/math/src/test/java/org/apache/harmony/tests/java/math/
BigIntegerHashCodeTest.java 44 aNumber1.divide(aNumber2).bitLength();
  /libcore/luni/src/main/java/java/lang/
HexStringParser.java 234 int bitLength = countBitsLength(mantissa);
235 if (bitLength > desiredWidth) {
236 discardTrailingBits(bitLength - desiredWidth);
238 mantissa <<= (desiredWidth - bitLength);
  /libcore/luni/src/test/java/tests/api/java/math/
BigIntegerTest.java 131 assertTrue("Bit length incorrect", bi.bitLength() == i);
288 for (int bitLength = 100; bitLength <= 600; bitLength += 100) {
289 BigInteger a = BigInteger.probablePrime(bitLength, rand);
290 BigInteger b = BigInteger.probablePrime(bitLength, rand);
294 " (bitLength = " + bitLength + ")",
334 for (int bitLength = 50; bitLength <= 1050; bitLength += 100)
    [all...]
  /external/bouncycastle/src/main/java/org/bouncycastle/crypto/engines/
RSACoreEngine.java 52 int bitSize = key.getModulus().bitLength();
73 int bitSize = key.getModulus().bitLength();
  /external/ganymed-ssh2/src/main/java/ch/ethz/ssh2/crypto/dh/
DhGroupExchange.java 49 x = new BigInteger(p.bitLength() - 1, rnd);
  /external/guava/guava/src/com/google/common/math/
BigIntegerMath.java 56 return x.signum() > 0 && x.getLowestSetBit() == x.bitLength() - 1;
69 int logFloor = x.bitLength() - 1;
100 int logX2Floor = x2.bitLength() - 1;
388 return x.bitLength() <= Long.SIZE - 1;

Completed in 4493 milliseconds

1 2 3