Efficient permutation instructions for fast software cryptography

摘要: Performing permutations in software can facilitate more widespread use of secure information processing and faster multimedia processing, but current instruction set architectures, even when augmented with subword-parallel instructions, do not provide efficient, bit-level permutations. Four new instructions each offer a solution. They are: PPERM (a new, lower-cost version PPERM3R that selects bits for one byte the result); GRP permutation separates into left right parts); CROSS using Benes interconnection network theory); OMFLIP enhanced Omega-Flip theory).