<P> The remaining 14 bytes (112 bits) of the key is then enumerated . This yields 2 112 (\ displaystyle 2 ^ (112)) unique base - keys; one for each group of keys . The ordinary 2 16 (\ displaystyle 2 ^ (16)) keys in each group is then chosen with respect to their base - key . They are chosen such that they are nearly identical to the base - key . They only vary in 2 bytes (either the i (\ displaystyle i)' s or the j (\ displaystyle j)' s) of the below shown 4 bytes: </P> <Dl> <Dd> <Dl> <Dd> (− − i i j − j − − − − − − − − −) (\ displaystyle (\ begin (bmatrix) - & - &i&i \ \ j& - &j& - \ \ - & - & - & - \ \ - & - & - & - \ end (bmatrix))) </Dd> </Dl> </Dd> </Dl> <Dd> <Dl> <Dd> (− − i i j − j − − − − − − − − −) (\ displaystyle (\ begin (bmatrix) - & - &i&i \ \ j& - &j& - \ \ - & - & - & - \ \ - & - & - & - \ end (bmatrix))) </Dd> </Dl> </Dd> <Dl> <Dd> (− − i i j − j − − − − − − − − −) (\ displaystyle (\ begin (bmatrix) - & - &i&i \ \ j& - &j& - \ \ - & - & - & - \ \ - & - & - & - \ end (bmatrix))) </Dd> </Dl>

What is the time complexity for a biclique attack on aes-192