I have read [a paper on Bit Slicing and Lightweight crypto](https://eprint.iacr.org/2013/445) but cannot understand how bitslicing makes encryption scheme faster.

Please can someone explain with an example exactly how bit slicing makes the code faster (even a single xor example will suffice)? Can bitslicing be applied to any encryption scheme?