By Topic

Efficient permutation instructions for fast software cryptography

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lee, R.B. ; Dept. of Electr. Eng., Princeton Univ., NJ, USA ; Shi, Z. ; Yang, X.

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 multimedia instructions, do not provide efficient, bit-level software permutations. Four new instructions each offer a solution. They are: PPERM (a new, lower-cost version of PPERM3R that selects bits for one byte of the result); GRP (a permutation instruction that separates bits into left and right parts); CROSS (a permutation instruction using Benes interconnection network theory); and OMFLIP (a permutation instruction using enhanced Omega-Flip interconnection network theory)

Published in:

Micro, IEEE  (Volume:21 ,  Issue: 6 )