Memory predecryption
Authors:
Open Access
- 1 March 2005
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGARCH Computer Architecture News
- Vol. 33 (1) , 27-33
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.Keywords
This publication has 10 references indexed in Scilit:
- Specifying and verifying hardware for tamper-resistant software2004
- Unlocking the design secrets of a 2.29 Gb/s Rijndael processorProceedings of the 39th conference on Design automation - DAC '02, 2002
- Dead-block prediction & dead-block correlating prefetchers2001
- Predictor-directed stream buffers2000
- Architectural support for copy and tamper resistant software2000
- Enhancing security in the memory management unit1999
- Prefetching using Markov predictors1997
- Memory-system design considerations for dynamically-scheduled processors1997
- Reducing memory latency via non-blocking and prefetching caches1992
- Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers1990