Lines Matching refs:in
24 * adding 12 rotate operations per round to compute the values contained in the other tables from
27 * The slowest version uses no static tables at all and computes the values in each round.
107 // vector used in calculating key schedule (powers of x in GF(256))
228 /* multiply four bytes in GF(2^8) by 'x' {02} in parallel */
274 int KC = key.length / 4; // key length in words
283 int[][] W = new int[ROUNDS+1][4]; // 4 words in a block
379 byte[] in,
389 if ((inOff + (32 / 2)) > in.length)
401 unpackBlock(in, inOff);
407 unpackBlock(in, inOff);