Bit permutation instructions for accelerating software cryptography

Zhijie Shi, Ruby Bei-Loh Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

96 Scopus citations

Abstract

Permutation is widely used in cryptographic 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.

Original languageEnglish (US)
Title of host publicationProceedings of the International Conference on Application-Specific Systems, Architectures and Processors
Pages138-148
Number of pages11
StatePublished - Dec 3 2000
Event2000 IEEE International Conference on Application-Specific Systems, Architectures, and Processors - Boston, MA, USA
Duration: Jul 10 2000Jul 12 2000

Other

Other2000 IEEE International Conference on Application-Specific Systems, Architectures, and Processors
CityBoston, MA, USA
Period7/10/007/12/00

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Shi, Z., & Lee, R. B-L. (2000). Bit permutation instructions for accelerating software cryptography. In Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors (pp. 138-148)