Fast parallel table lookups to accelerate symmetric-key cryptography

A. Murat Fiskiran, Ruby Bei-Loh Lee

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

14 Scopus citations

Abstract

Table lookups are one of the most frequently-used operations in symmetric-key ciphers. Particularly in the newer algorithms such as the Advanced Encryption Standard (AES), we frequently find that the greatest fraction of the execution time is spent during table lookups, varying between 34% and 72% for the five representative ciphers we consider: AES, Blowfish, Twofish, MARS, and RC4. In order to accelerate and parallelize these table lookups, we describe a new parallel table lookup (ptlu) instruction. Our synthesis results indicate that such an instruction can be added to a basic RISC processor with no cycle time impact. We compare the performance of the ptlu instruction with the speedups available through more conventional architectural techniques such as multiple-issue execution. We find that the performance benefits of using the ptlu instruction can be far higher than increasing the number of instructions executed per cycle in superscalar or VLIW processors.

Original languageEnglish (US)
Title of host publicationProceedings ITCC 2005 - International Conference on Information Technology
Subtitle of host publicationCoding and Computing
EditorsH. Selvaraj, P.K. Srimani
Pages526-531
Number of pages6
StatePublished - Sep 21 2005
EventITCC 2005 - International Conference on Information Technology: Coding and Computing - Las Vegas, NV, United States
Duration: Apr 4 2005Apr 6 2005

Publication series

NameInternational Conference on Information Technology: Coding and Computing, ITCC
Volume1

Other

OtherITCC 2005 - International Conference on Information Technology: Coding and Computing
CountryUnited States
CityLas Vegas, NV
Period4/4/054/6/05

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'Fast parallel table lookups to accelerate symmetric-key cryptography'. Together they form a unique fingerprint.

  • Cite this

    Fiskiran, A. M., & Lee, R. B-L. (2005). Fast parallel table lookups to accelerate symmetric-key cryptography. In H. Selvaraj, & P. K. Srimani (Eds.), Proceedings ITCC 2005 - International Conference on Information Technology: Coding and Computing (pp. 526-531). (International Conference on Information Technology: Coding and Computing, ITCC; Vol. 1).