Security Memory System for Mobile Device or Computer Against Memory Attacks
Security is a crucial element of information systems. Extensive research for cryptographic algorithms that provide the sound theoretical basis of security. Among them security and integrity of memory has been a longstanding issue in trusted system design. Main memory is a critical component of all computing systems. Most of those systems are vulnerable to memory attacks, in which an attacker gains physical accesses to the unattended hardware, obtains the decryption keys from memory. We propose a method for protecting memory systems against attacks with hardware authentication and full memory encryption. The method is secure against all known type of memory attack. We have tested the method with software simulator and Field Programmable Gate Array (FPGA) platform. The results show that the method can authenticate and encrypt the contents of DRAM with 2.5 % performance penalties.
KeywordsSecurity Memory system Computer Attacks
This work is supported by the Natural Science Foundation of China under Grant No.61300014.
- 1.Skorobogatov, S.: Low temperature data remanence in static RAM. University of Cambridge Computer Laborary Technical Report (2002)Google Scholar
- 4.Lee, R.B., Kwan, P.C.S., et al.: Architecture for protecting critical secrets in microprocessors. In: The 32nd Annual International Symposium on Computer Architecture (ISCA ‘05), Washington, DC (2005)Google Scholar
- 7.Jacob, B., Ng, S.W., Wang, D.T., et al.: Memory Systems: Cache, DRAM, Disk. Morgan Kaufmann, San Francisco (2007)Google Scholar
- 8.Merkle, R.C.: A digital signature based on a conventional encryption function. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 369–378. Springer, Heidelberg (1988)Google Scholar
- 10.Elbaz, R., Champagne, D., Lee, R.B., Torres, L., Sassatelli, G., Guillemin, P.: TEC-Tree: a low-cost, parallelizable tree for efficient defense against memory replay attacks. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol. 4727, pp. 289–302. Springer, Heidelberg (2007)CrossRefGoogle Scholar