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 language | English (US) |
---|---|
Pages | 138-148 |
Number of pages | 11 |
State | Published - 2000 |
Event | 2000 IEEE International Conference on Application-Specific Systems, Architectures, and Processors - Boston, MA, USA Duration: Jul 10 2000 → Jul 12 2000 |
Other
Other | 2000 IEEE International Conference on Application-Specific Systems, Architectures, and Processors |
---|---|
City | Boston, MA, USA |
Period | 7/10/00 → 7/12/00 |
All Science Journal Classification (ASJC) codes
- Hardware and Architecture
- Computer Networks and Communications