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

1 2 3 4 5 6 7 8

  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/field/
FiniteFields.java 34 int bitLength = characteristic.bitLength();
35 if (characteristic.signum() <= 0 || bitLength < 2)
40 if (bitLength < 3)
  /libcore/luni/src/test/java/libcore/java/math/
BigIntegerTest.java 93 assertTrue(b.toString() + " " + b.bitLength(), b.bitLength() <= 128);
96 assertTrue(b.toString() + " " + b.bitLength(), b.bitLength() <= 16);
99 assertTrue(b.toString() + " " + b.bitLength(), b.bitLength() <= 5);
108 assertEquals(b.toString(), 128, b.bitLength());
112 assertEquals(b.toString(), 16, b.bitLength());
116 assertEquals(b.toString(), 5, b.bitLength());
126 assertEquals(b.toString(), 2, b.bitLength());
    [all...]
  /external/bouncycastle/bcprov/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();
  /libcore/ojluni/src/main/java/sun/security/util/
KeyUtil.java 77 size = pubk.getModulus().bitLength();
81 // Was: size = pubk.getParams().getOrder().bitLength();
89 size = params.getOrder().bitLength();
95 size = (params != null) ? params.getP().bitLength() : -1;
98 size = pubk.getParams().getP().bitLength();
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/util/
BigIntegers.java 88 if (min.bitLength() > max.bitLength() / 2)
95 BigInteger x = new BigInteger(max.bitLength(), random);
103 return new BigInteger(max.subtract(min).bitLength() - 1, random).add(min);
  /libcore/ojluni/src/main/java/java/security/spec/
ECFieldFp.java 65 return p.bitLength();
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/math/
OldBigIntegerTest.java 86 assertEquals(i, bi.bitLength());
176 for (int bitLength = 100; bitLength <= 600; bitLength += 100) {
177 BigInteger a = BigInteger.probablePrime(bitLength, rand);
178 BigInteger b = BigInteger.probablePrime(bitLength, rand);
182 " (bitLength = " + bitLength + ")",
222 for (int bitLength = 50; bitLength <= 1050; bitLength += 100)
    [all...]
  /libcore/luni/src/main/java/java/math/
BigDecimal.java 185 LONG_FIVE_POW_BIT_LENGTH[i] = bitLength(LONG_FIVE_POW[i]);
188 LONG_POWERS_OF_TEN_BIT_LENGTH[i] = bitLength(MathUtils.LONG_POWERS_OF_TEN[i]);
217 private transient int bitLength;
240 this.bitLength = bitLength(smallValue);
246 this.bitLength = bitLength(smallValue);
345 bitLength = bitLength(smallValue);
489 int mantissaBits = bitLength(mantissa)
    [all...]
BigInteger.java 149 * pow(2, bitLength)-1]} which is probably prime. The probability that the
154 * {@code bitLength >= 16}, where this implementation will use OpenSSL's
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 random) {
164 if (bitLength < 2) {
165 throw new ArithmeticException("bitLength < 2: " + bitLength);
167 if (bitLength < 16) {
171 candidate = random.nextInt() & ((1 << bitLength) - 1)
    [all...]
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/digests/
GeneralDigest.java 115 long bitLength = (byteCount << 3);
127 processLength(bitLength);
157 protected abstract void processLength(long bitLength);
  /external/conscrypt/platform/src/main/java/org/conscrypt/
ChainStrengthAnalyzer.java 77 int modulusLength = ((RSAPublicKey) pubkey).getModulus().bitLength();
90 int pLength = ((DSAPublicKey) pubkey).getParams().getP().bitLength();
91 int qLength = ((DSAPublicKey) pubkey).getParams().getQ().bitLength();
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/signers/
RandomDSAKCalculator.java 32 int qBitLength = q.bitLength();
  /frameworks/base/services/net/java/android/net/util/
PrefixUtils.java 74 final int bitLength = (ip instanceof Inet4Address)
77 return new IpPrefix(ip, bitLength);
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
WNafUtil.java 17 if ((k.bitLength() >>> 16) != 0)
19 throw new IllegalArgumentException("'k' must have bitlength < 2^16");
28 int bits = _3k.bitLength();
69 if ((k.bitLength() >>> 16) != 0)
71 throw new IllegalArgumentException("'k' must have bitlength < 2^16");
78 int[] wnaf = new int[k.bitLength() / width + 1];
88 while (pos <= k.bitLength())
126 int digits = Math.max(g.bitLength(), h.bitLength()) + 1;
133 while ((d0 | d1) != 0 || k0.bitLength() > offset || k1.bitLength() > offset
    [all...]
  /external/wycheproof/java/com/google/security/wycheproof/testcases/
RsaKeyTest.java     [all...]
  /packages/apps/ExactCalculator/src/com/android/calculator2/
BoundedRational.java 178 final int apprExp = mNum.bitLength() - mDen.bitLength();
187 final int qLength = quotient.bitLength();
203 if (exponent > -1023 && bigMantissa.bitLength() != 53
204 || exponent <= -1023 && bigMantissa.bitLength() >= 53) {
230 return mNum.bitLength() - mDen.bitLength();
242 return (mNum.bitLength() + mDen.bitLength() > MAX_SIZE);
497 if (exp.bitLength() > 1000)
    [all...]
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/
RSAKeyPairGenerator.java 73 if (diff.bitLength() < mindiffbits || diff.compareTo(minDiff) <= 0)
83 if (n.bitLength() != strength)
154 * @param bitlength the bit-length of the returned prime
158 protected BigInteger chooseRandomPrime(int bitlength, BigInteger e, BigInteger sqrdBound)
160 for (int i = 0; i != 5 * bitlength; i++)
162 BigInteger p = new BigInteger(bitlength, 1, param.getRandom());
192 int iterations = getNumberOfIterations(x.bitLength(), param.getCertainty());
DHKeyGeneratorHelper.java 52 int minWeight = max.bitLength() >>> 2;
DSAKeyPairGenerator.java 50 int minWeight = q.bitLength() >>> 2;
55 // BigInteger x = new BigInteger(q.bitLength() + 64, random).mod(q.subtract(ONE)).add(ONE);
  /external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/cert/selector/
MSOutlookKeyIdCalculator.java 129 long bitLength = (byteCount << 3);
141 processLength(bitLength);
159 protected abstract void processLength(long bitLength);
211 long bitLength)
218 X[14] = (int)(bitLength >>> 32);
219 X[15] = (int)(bitLength & 0xffffffff);
  /external/wycheproof/java/com/google/security/wycheproof/
RandomUtil.java 113 * where k is max(64, x.BitLength());
151 int size = p.bitLength();
176 if (p.bitLength() < 96) {
  /bootable/recovery/tools/dumpkey/
DumpPublicKey.java 62 if (modulus.bitLength() != 2048) {
64 modulus.bitLength() + " bits.");
113 int nwords = N.bitLength() / 32; // # of 32 bit integers in modulus
130 BigInteger R = BigInteger.valueOf(2).pow(N.bitLength());
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/agreement/
DHBasicAgreement.java 54 return (key.getParameters().getP().bitLength() + 7) / 8;

Completed in 2138 milliseconds

1 2 3 4 5 6 7 8