A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We propose two new instructions, swperm and sieve, that can be used to efficiently complete an arbitrary bit-level permutation of an -bit word with or without repetitions. Permutations with repetitions are rearrangements of an ordered set in which elements may replace other elements in the set; such permutations are useful in cryptographic algorithms. On a four-way superscalar processor, we can complete an arbitrary 64-bit permutation with repetitions of 1-bit subwords in 11 instructions anddoi:10.1109/tvlsi.2003.812318 fatcat:z5iysudvgrhgbpaydfgshymxra