OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:bitLength
(Results
26 - 50
of
160
) sorted by null
1
2
3
4
5
6
7
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/custom/sec/
SecP256R1Curve.java
58
return q.
bitLength
();
SecP384R1Curve.java
58
return q.
bitLength
();
SecP521R1Curve.java
58
return q.
bitLength
();
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/math/
BigIntegerHashCodeTest.java
44
aNumber1.divide(aNumber2).
bitLength
();
/libcore/luni/src/main/java/java/math/
NativeBN.java
74
public static native int
bitLength
(long a);
BigInt.java
215
int actualByteCount = (NativeBN.
bitLength
(this.bignum) + 7) / 8;
219
int
bitLength
() {
220
return NativeBN.
bitLength
(this.bignum);
335
static BigInt generatePrimeDefault(int
bitLength
) {
337
NativeBN.BN_generate_prime_ex(r.bignum,
bitLength
, false, 0, 0, 0);
Primality.java
94
if (ni.
bitLength
() <= 10) {
109
// j = startPoint.
bitLength
();
/system/core/libmincrypt/tools/
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/math/ec/
ECFieldElement.java
27
public int
bitLength
()
29
return toBigInteger().
bitLength
();
34
return
bitLength
() == 1;
93
int
bitLength
= p.
bitLength
();
94
if (
bitLength
>= 96)
96
BigInteger firstWord = p.shiftRight(
bitLength
- 64);
99
return ONE.shiftLeft(
bitLength
).subtract(p);
142
return q.
bitLength
();
293
P = new BigInteger(q.
bitLength
(), rand)
[
all
...]
ECAlgorithms.java
191
int t = x.
bitLength
();
265
int widthP = Math.max(2, Math.min(16, WNafUtil.getWindowSize(k.
bitLength
())));
266
int widthQ = Math.max(2, Math.min(16, WNafUtil.getWindowSize(l.
bitLength
())));
289
int width = Math.max(2, Math.min(16, WNafUtil.getWindowSize(Math.max(k.
bitLength
(), l.
bitLength
()))));
370
int width = Math.max(2, Math.min(16, WNafUtil.getWindowSize(ki.
bitLength
())));
425
int width = Math.max(2, Math.min(16, WNafUtil.getWindowSize(Math.max(kj0.
bitLength
(), kj1.
bitLength
()))));
FixedPointUtil.java
12
return order == null ? c.getFieldSize() + 1 : order.
bitLength
();
WNafL2RMultiplier.java
21
int width = Math.max(2, Math.min(16, getWindowSize(k.
bitLength
())));
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/sec/
ECPrivateKey.java
56
this(key.
bitLength
(), key);
62
* @param orderBitLength the
bitLength
of the order of the curve.
97
this(key.
bitLength
(), key, publicKey, parameters);
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/
RSACoreEngine.java
52
int bitSize = key.getModulus().
bitLength
();
73
int bitSize = key.getModulus().
bitLength
();
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/
RSAKeyPairGenerator.java
75
if (diff.
bitLength
() < mindiffbits || diff.compareTo(minDiff) <= 0)
85
if (n.
bitLength
() != strength)
156
* @param
bitlength
the bit-length of the returned prime
160
protected BigInteger chooseRandomPrime(int
bitlength
, BigInteger e, BigInteger sqrdBound)
162
for (int i = 0; i != 5 *
bitlength
; i++)
164
BigInteger p = new BigInteger(
bitlength
, 1, param.getRandom());
ECKeyPairGenerator.java
46
int nBitLength = n.
bitLength
();
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/signers/
DSASigner.java
148
if (n.
bitLength
() >= message.length * 8)
154
byte[] trunc = new byte[n.
bitLength
() / 8];
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/
BouncyCastleProviderConfiguration.java
147
if (spec.getP().
bitLength
() == keySize)
158
if (specs[i].getP().
bitLength
() == keySize)
/external/guava/guava/src/com/google/common/math/
DoubleUtils.java
94
int exponent = absX.
bitLength
() - 1;
/libcore/ojluni/src/main/java/java/security/spec/
EllipticCurve.java
63
if (c.
bitLength
() > m) {
/prebuilts/go/darwin-x86/src/compress/flate/
reverse_bits.go
46
func reverseBits(number uint16,
bitLength
byte) uint16 {
47
return reverseUint16(number << uint8(16-
bitLength
))
/prebuilts/go/linux-x86/src/compress/flate/
reverse_bits.go
46
func reverseBits(number uint16,
bitLength
byte) uint16 {
47
return reverseUint16(number << uint8(16-
bitLength
))
/cts/tests/tests/keystore/src/android/keystore/cts/
RSASignatureTest.java
62
int modulusSizeBits = ((RSAKey) publicKey).getModulus().
bitLength
();
130
assertEquals(512, ((RSAKey) keyPair.getPrivate()).getModulus().
bitLength
());
131
assertEquals(512, ((RSAKey) keyPair.getPublic()).getModulus().
bitLength
());
/external/guava/guava-gwt/src-super/com/google/common/math/super/com/google/common/math/
BigIntegerMath.java
55
return x.signum() > 0 && x.getLowestSetBit() == x.
bitLength
() - 1;
69
int logFloor = x.
bitLength
() - 1;
100
int logX2Floor = x2.
bitLength
() - 1;
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/
Primes.java
163
if (candidate.
bitLength
() == 2)
289
if (candidate.
bitLength
() == 2)
340
if (candidate.
bitLength
() == 2)
356
if (n == null || n.signum() < 1 || n.
bitLength
() < 2)
539
if (c.
bitLength
() > length)
Completed in 694 milliseconds
1
2
3
4
5
6
7