Lines Matching refs:length
53 * as a BigInteger of length (b.length * 8) bits. The result is
54 * modulo 2^b.length in case of overflow.
61 int x = (b[b.length - 1] & 0xff) + (a[aOff + b.length - 1] & 0xff) + 1;
63 a[aOff + b.length - 1] = (byte)x;
66 for (int i = b.length - 2; i >= 0; i--)
84 for (int i = 0; i != D.length; i++)
91 if ((salt != null) && (salt.length != 0))
93 S = new byte[v * ((salt.length + v - 1) / v)];
95 for (int i = 0; i != S.length; i++)
97 S[i] = salt[i % salt.length];
107 if ((password != null) && (password.length != 0))
109 P = new byte[v * ((password.length + v - 1) / v)];
111 for (int i = 0; i != P.length; i++)
113 P[i] = password[i % password.length];
121 byte[] I = new byte[S.length + P.length];
123 System.arraycopy(S, 0, I, 0, S.length);
124 System.arraycopy(P, 0, I, S.length, P.length);
132 digest.update(D, 0, D.length);
133 digest.update(I, 0, I.length);
137 digest.update(A, 0, A.length);
141 for (int j = 0; j != B.length; j++)
143 B[j] = A[j % A.length];
146 for (int j = 0; j != I.length / v; j++)
153 System.arraycopy(A, 0, dKey, (i - 1) * u, dKey.length - ((i - 1) * u));
157 System.arraycopy(A, 0, dKey, (i - 1) * u, A.length);
