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))
558 /* multiply four bytes in GF(2^8) by 'x' {02} in parallel */
605 int KC = key.length / 4; // key length in words
614 int[][] W = new int[ROUNDS+1][4]; // 4 words in a block
710 byte[] in,
720 if ((inOff + (32 / 2)) > in.length)
732 unpackBlock(in, inOff);
738 unpackBlock(in, inOff);