| /external/bouncycastle/src/main/java/org/bouncycastle/crypto/params/ |
| DSAKeyGenerationParameters.java | 16 super(random, params.getP().bitLength() - 1);
|
| DHKeyGenerationParameters.java | 28 return params.getL() != 0 ? params.getL() : params.getP().bitLength();
|
| DHParameters.java | 87 if (l >= p.bitLength())
89 throw new IllegalArgumentException("when l value specified, it must be less than bitlength(p)");
|
| /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)) {
|
| ECFieldF2m.java | 90 if ((this.rp.bitLength() != (m+1)) ||
|
| /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);
|
| SHA1Digest.java | 76 long bitLength)
83 X[14] = (int)(bitLength >>> 32);
84 X[15] = (int)(bitLength & 0xffffffff);
|
| SHA256Digest.java | 87 long bitLength)
94 X[14] = (int)(bitLength >>> 32);
95 X[15] = (int)(bitLength & 0xffffffff);
|
| /libcore/luni/src/main/java/java/math/ |
| BigDecimal.java | 212 LONG_FIVE_POW_BIT_LENGTH[j] = bitLength(LONG_FIVE_POW[j]);
215 LONG_POWERS_OF_TEN_BIT_LENGTH[j] = bitLength(MathUtils.LONG_POWERS_OF_TEN[j]);
229 private transient int bitLength;
252 this.bitLength = bitLength(smallValue);
258 this.bitLength = bitLength(smallValue);
361 bitLength = bitLength(smallValue);
523 int mantissaBits = bitLength(mantissa)
[all...] |
| BigInteger.java | 155 * pow(2, bitLength)-1]} which is probably prime. The probability that the
163 * @param bitLength length of the new {@code BigInteger} in bits.
165 * @throws ArithmeticException if {@code bitLength < 2}.
169 public BigInteger(int bitLength, int certainty, Random unused) {
170 if (bitLength < 2) {
171 throw new ArithmeticException("bitLength < 2: " + bitLength);
173 setBigInt(BigInt.generatePrimeDefault(bitLength));
482 * {@code bitLength() + 1} bits long.
484 * <p>The value will fit into an {@code int} if {@code bitLength() < 32} o
[all...] |
| BigInt.java | 252 int actualByteCount = (NativeBN.bitLength(this.bignum) + 7) / 8;
256 public int bitLength() {
257 return NativeBN.bitLength(this.bignum);
376 public static BigInt generatePrimeDefault(int bitLength) {
378 Check(NativeBN.BN_generate_prime_ex(r.bignum, bitLength, false, 0, 0, 0));
|
| NativeBN.java | 86 public static native int bitLength(int a);
|
| Primality.java | 100 if (ni.bitLength() <= 10) {
115 // j = startPoint.bitLength();
|
| Conversion.java | 76 int resLengthInChars = (int) (val.abs().bitLength() / bitsForRadixDigit + ((sign < 0) ? 1
420 // val.bitLength() < 64
425 // val.bitLength() >= 33 * 32 > 1024
430 int bitLen = val.abs().bitLength();
|
| /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/crypto/signers/ |
| 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())
|
| DSAParametersGenerator.java | 130 if (p.bitLength() != L)
154 if (g.bitLength() > 1)
245 if (p.bitLength() != L)
|
| /libcore/luni/src/main/java/org/apache/harmony/luni/util/ |
| HexStringParser.java | 244 int bitLength = countBitsLength(mantissa);
245 if (bitLength > desiredWidth) {
246 discardTrailingBits(bitLength - desiredWidth);
248 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();
|
| /libcore/luni/src/main/java/org/apache/harmony/security/provider/crypto/ |
| SHA1withDSA_SignatureImpl.java | 94 n = p.bitLength();
98 if (q.signum() != 1 && q.bitLength() != 160) {
137 n1 = p.bitLength();
141 if (q.signum() != 1 || q.bitLength() != 160) {
|
| /external/protobuf/java/src/main/java/com/google/protobuf/ |
| TextFormat.java | [all...] |
