the block cipher part is harder to bit slice, as the s-boxes involved are too large (8x8) to be efficiently implemented using logical operations, a prerequisite for bit slicing to be more efficient than a regular implementation. however, as all operations are on 8-bit subblocks, the algorithm can be implemented using regular simd, or a form of “byteslicing”. as most simd instruction sets, (with the exception of avx2) do not support parallel look-up tables, the s-box lookups are done in a non-bytesliced implementation, but their integration into the rest of the algorithm is not hampered markedly by the byteslicing.