Memory predecryption: hiding the latency overhead of memory encryption

  • Authors:
  • Brian Rogers;Yan Solihin;Milos Prvulovic

  • Affiliations:
  • North Carolina State University;North Carolina State University;Georgia Institute of Technology

  • Venue:
  • ACM SIGARCH Computer Architecture News - Special issue: Workshop on architectural support for security and anti-virus (WASSA)
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Memory encryption has become a common approach to providing a secure processing environment, but current schemes suffer from extra performance and storage overheads. This paper presents predecryption as a method of providing this security with less overhead by using well-known prefetching techniques to retrieve data from memory and perform decryption before it is needed by the processor. Our results, tested mostly on SPEC 2000 benchmarks, show that using our predecryption scheme can actually result in no increase in execution time despite an extra 128 cycle decryption latency per memory block access.