Bit permutation instructions for accelerating software cryptography

Author

Shi, Zhijie ; Lee, Ruby B.

Author_Institution

Dept. of Electr. Eng., Princeton Univ., NJ, USA

fYear

2000

fDate

2000

Firstpage

138

Lastpage

148

Abstract

Permutation is widely used in cryprographic algorithms. However, it is not well-supported in existing instruction sets. In this paper, two instructions, PPERM3R and GRP, are proposed for efficient software implementation of arbitrary permutations. The PPERM3R instruction can be used for dynamically specified permutations; the GRP instruction can be used to do arbitrary n-bit permutations with up to lg(n) instructions. In addition, a systematic method for determining the instruction sequence for performing an arbitrary permutation is described

Keywords

cryptography; instruction sets; software performance evaluation; GRP instruction; PPERM3R instruction; arbitrary n-bit permutations; bit permutation instructions; cryprographic algorithms; dynamically specified permutations; efficient software implementation; instruction sequence; instruction sets; software cryptography acceleration; Acceleration; Computer architecture; Cryptography; Information processing; Instruction sets; Microprocessors; Registers; Software performance; Table lookup;

fLanguage

English

Publisher

ieee

Conference_Titel

Application-Specific Systems, Architectures, and Processors, 2000. Proceedings. IEEE International Conference on

Conference_Location

Boston, MA

ISSN

2160-0511

Print_ISBN

0-7695-0716-6

Type

conf

DOI

10.1109/ASAP.2000.862385

Filename

862385