Abstract
Encryption algorithms commonly use table lookups to perform substitution, which is a confusion primitive. The use of table lookups in this way is especially common in the more recent encryption algorithms, such as the AES finalists like Twofish and MARS, and the AES winner, Rijndael. Workload characterization studies indicate that these algorithms spend a significant fraction of their execution cycles on performing these table lookups, more specifically on effective address calculations. This study considers the five AES finalists (MARS, RC6, Rijndael, Serpent and Twofish) and studies the effect of different addressing modes that can be used to calculate the effective addresses during the table lookups. We report our findings for four different addressing modes and on varying width EPIC processors. The results indicate that speedups exceeding 2x can be obtained when fast addressing modes are used.
| Original language | English (US) |
|---|---|
| Pages | 542-545 |
| Number of pages | 4 |
| State | Published - 2001 |
| Event | IEEE International Conference on: Computer Design: VLSI in Computers and Processors (ICCD 2001) - Austin, TX, United States Duration: Sep 23 2001 → Sep 26 2001 |
Other
| Other | IEEE International Conference on: Computer Design: VLSI in Computers and Processors (ICCD 2001) |
|---|---|
| Country/Territory | United States |
| City | Austin, TX |
| Period | 9/23/01 → 9/26/01 |
All Science Journal Classification (ASJC) codes
- Hardware and Architecture
- Electrical and Electronic Engineering