Advertisement

Enhancing security of NVM-based main memory with dynamic Feistel network mapping

  • Fang-ting Huang
  • Dan Feng
  • Wen Xia
  • Wen Zhou
  • Yu-cheng Zhang
  • Min Fu
  • Chun-tao Jiang
  • Yu-kun Zhou
Article
  • 1 Downloads

Abstract

As promising alternatives in building future main memory systems, emerging non-volatile memory (NVM) technologies can increase memory capacity in a cost-effective and power-efficient way. However, NVM is facing security threats due to its limited write endurance: a malicious adversary can wear out the cells and cause the NVM system to fail quickly. To address this issue, several wear-leveling schemes have been proposed to evenly distribute write traffic in a security-aware manner. In this study, we present a new type of timing attack, remapping timing attack (RTA), based on information leakage from the remapping latency difference in NVM. Our analysis and experimental results show that RTA can cause three of the latest wear-leveling schemes (i.e., region-based start-gap, security refresh, and multi-way wear leveling) to lose their effectiveness in several days (even minutes), causing failure of NVM. To defend against such an attack, we further propose a novel wear-leveling scheme called the ‘security region-based start-gap (security RBSG)’, which is a two-stage strategy using a dynamic Feistel network to enhance the simple start-gap wear leveling with level-adjustable security assurance. The theoretical analysis and evaluation results show that the proposed security RBSG not only performs well when facing traditional malicious attacks, but also better defends against RTA.

Key words

Non-volatile memory (NVM) Endurance Wear leveling Timing attack 

CLC number

TP309 TP333 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Binkert N, Beckmann B, Black G, et al., 2011. The gem5 simulator. ACM SIGARCH Comput Archit News, 39(2):1–7.  https://doi.org/10.1145/2024716.2024718 CrossRefGoogle Scholar
  2. Bishnoi R, Ebrahimi M, Oboril F, et al., 2014. Asynchronous asymmetrical write termination (AAWT) for a low power STT–MRAM. Design, Automation & Test in Europe Conf & Exhibition, p.1–6.  https://doi.org/10.7873/DATE.2014.193 Google Scholar
  3. Cho S, Lee H, 2009. Flip–N–write: a simple deterministic technique to improve PRAM write performance, energy and endurance. Proc 42nd Annual IEEE/ACM Int Symp on Microarchitecture, p.347–357.  https://doi.org/10.1145/1669112.1669157 Google Scholar
  4. Chung H, Jeong BH, Min BJ, et al., 2011. A 58nm 1.8V 1Gb PRAM with 6.4MB/s program BW. IEEE Int Solid–State Circuits Conf, p.500–502.  https://doi.org/10.1109/ISSCC.2011.5746415 Google Scholar
  5. Freitas RF, Wilcke WW, 2008. Storage–class memory: the next storage system technology. IBM J Res Dev, 52(4–5):439–447.  https://doi.org/10.1147/rd.524.0439 CrossRefGoogle Scholar
  6. Gal E, Toledo S, 2005. Algorithms and data structures for flash memories. ACM Comput Surv, 37(2):138–163.  https://doi.org/10.1145/1089733.1089735 CrossRefGoogle Scholar
  7. Gove D, 2007. CPU2006 working set size. ACM SIGARCH Comput Archit News, 35(1):90–96.  https://doi.org/10.1145/1241601.1241619 CrossRefGoogle Scholar
  8. Huai Y, 2008. Spin–transfer torque MRAM (STT–MRAM): challenges and prospects. AAPPS Bull, 18(6):33–40.Google Scholar
  9. Huang F, Feng D, Xia W, et al., 2016. Security RBSG: protecting phase change memory with security–level adjustable dynamic mapping. IEEE Int Parallel and Distributed Processing Symp, p.1081–1090.  https://doi.org/10.1109/IPDPS.2016.22 Google Scholar
  10. Kim YB, Lee SR, Lee D, et al., 2011. Bi–layered RRAM with unlimited endurance and extremely uniform switching. Symp on VLSI Technology, p.52–53.Google Scholar
  11. Li Z, Wang F, Hua Y, et al., 2016. Exploiting more parallelism from write operations on PCM. Design, Automation & Test in Europe Conf & Exhibition, p.768–773.  https://doi.org/10.3850/9783981537079_0099 CrossRefGoogle Scholar
  12. Liddicoat AA, Flynn MJ, 2000. Parallel square and cube computations. Conf Record of the 34th Asilomar Conf on Signals, Systems and Computers, p.1325–1329.  https://doi.org/10.1109/ACSSC.2000.911207 CrossRefGoogle Scholar
  13. Menezes AJ, van Oorschot PC, Vanstone SA, 1996. Handbook of Applied Cryptography. CRC Press, Boca Raton, USA, p.683.CrossRefzbMATHGoogle Scholar
  14. Micron Inc., 2011. Micron 128Mb P8P Parallel PCM Data Sheet.Google Scholar
  15. Mittal S, Vetter JS, 2016. A survey of software techniques for using non–volatile memories for storage and main memory systems. IEEE Trans Parall Distr Syst, 27(5):1537–1550.  https://doi.org/10.1109/TPDS.2015.2442980 CrossRefGoogle Scholar
  16. Mittal S, Vetter JS, Li D, 2015. A survey of architectural approaches for managing embedded dram and non–volatile on–chip caches. IEEE Trans Parall Distr Syst, 26(6):1524–1537.  https://doi.org/10.1109/TPDS.2014.2324563 CrossRefGoogle Scholar
  17. Palangappa PM, Mohanram K, 2016. CompEx: compression–expansion coding for energy, latency, and lifetime improvements in MLC/TLC NVM. IEEE Int Symp on High Performance Computer Architecture, p.90–101.  https://doi.org/10.1109/HPCA.2016.7446056 Google Scholar
  18. Qureshi MK, Karidis J, Franceschini M, et al., 2009. Enhancing lifetime and security of PCM–based main memory with start–gap wear leveling. Proc 42nd Annual IEEE/ACM Int Symp on Microarchitecture, p.14–23.  https://doi.org/10.1145/1669112.1669117 CrossRefGoogle Scholar
  19. Qureshi MK, Seznec A, Lastras LA, et al., 2011. Practical and secure PCM systems by online detection of malicious write streams. IEEE 17th Int Symp on High Performance Computer Architecture, p.478–489.  https://doi.org/10.1109/HPCA.2011.5749753 CrossRefGoogle Scholar
  20. Qureshi MK, Franceschini MM, Jagmohan A, et al., 2012. PreSET: improving performance of phase change memories by exploiting asymmetry in write times. ACM SIGARCH Comput Archit News, 40(3):380–391.  https://doi.org/10.1145/2366231.2337203 CrossRefGoogle Scholar
  21. Seznec A, 2009. Towards Phase Change Memory as a Secure Main Memory. Technical Report, No. RR–7088. INRIA, Campus Universitaire de Beaulieu, Rennes.Google Scholar
  22. Woo NH, Seongand DH, Lee HS, 2010. Security refresh: prevent malicious wear–out and increase durability for phase–change memory with dynamically randomized address mapping. ACM SIGARCH Comput Archit News, 38(3):383–394.  https://doi.org/10.1145/1816038.1816014 CrossRefGoogle Scholar
  23. Yang BD, Lee JE, Kim JS, et al., 2007. A low power phasechange random access memory using a data–comparison write scheme. IEEE Int Symp on Circuits and Systems, p.3014–3017.  https://doi.org/10.1109/ISCAS.2007.377981 Google Scholar
  24. Yu H, Du Y, 2014. Increasing endurance and security of phase–change memory with multi–way wear–leveling. IEEE Trans Comput, 63(5):1157–1168.  https://doi.org/10.1109/TC.2012.292 MathSciNetCrossRefzbMATHGoogle Scholar
  25. Yun J, Lee S, Yoo S, 2012. Bloom filter–based dynamic wear leveling for phase–change RAM. Design, Automation & Test in Europe Conf & Exhibition, p.1513–1518.  https://doi.org/10.1109/DATE.2012.6176713 Google Scholar
  26. Zhou P, Zhao B, Yang J, et al., 2009. A durable and energy efficient main memory using phase change memory technology. ACM SIGARCH Comput Archit News, p.14–23.  https://doi.org/10.1145/1555815.1555759 CrossRefGoogle Scholar

Copyright information

© Zhejiang University and Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Wuhan National Laboratory for OptoelectronicsWuhanChina
  2. 2.MOE Key Laboratory of Information Storage SystemWuhanChina
  3. 3.School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhanChina

Personalised recommendations