Lines Matching refs:length
68 * Repeat this step until the length of X matches the length of the private key
84 * generated, but taken from the result R of step 4 (the first length(s)
90 * last length(digest(p, P)) bytes of R. If they match, the recovered key is
105 private static final int SALT_LEN = 20; // the salt length
139 passwdBytes = new byte[password.length * 2];
140 for (i=0, j=0; i<password.length; i++) {
185 numRounds = plainKey.length / DIGEST_LEN;
186 if ((plainKey.length % DIGEST_LEN) != 0)
195 byte[] xorKey = new byte[plainKey.length];
208 digest.length);
211 xorKey.length - xorOffset);
216 byte[] tmpKey = new byte[plainKey.length];
217 for (i = 0; i < tmpKey.length; i++) {
222 byte[] encrKey = new byte[salt.length + tmpKey.length + DIGEST_LEN];
223 System.arraycopy(salt, 0, encrKey, encrKeyOffset, salt.length);
224 encrKeyOffset += salt.length;
225 System.arraycopy(tmpKey, 0, encrKey, encrKeyOffset, tmpKey.length);
226 encrKeyOffset += tmpKey.length;
235 System.arraycopy(digest, 0, encrKey, encrKeyOffset, digest.length);
259 int encrKeyLen; // the length of the encrpyted key
278 encrKeyLen = protectedKey.length - SALT_LEN - DIGEST_LEN;
287 byte[] xorKey = new byte[encrKey.length];
300 digest.length);
303 xorKey.length - xorOffset);
308 byte[] plainKey = new byte[encrKey.length];
309 for (i = 0; i < plainKey.length; i++) {
326 for (i = 0; i < digest.length; i++) {