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 multimedia instructions, do not provide efficient, bit-level software permuta...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE MICRO Vol. 21; no. 6; pp. 56 - 69
Main Authors:	Lee, R.B., Zhijie Shi, Xiiao Yang
Format:	Journal Article
Language:	English
Published:	Los Alamitos IEEE 01-11-2001 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Communication system security Computer architecture Computer programming Computer programs Cryptography Data security Glass fiber reinforced plastics Information processing Information security Instruction sets Interconnection Microprocessors Multimedia Networks Permutations Public key cryptography Software Software algorithms Software performance
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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).
Bibliography:	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
ISSN:	0272-1732 1937-4143
DOI:	10.1109/40.977759