Skip to main content
SpringerLink
Log in

Security Vulnerabilities and Countermeasures for Approximate Circuits

  • Chapter
  • First Online:
Approximate Computing

  • 972 Accesses

Abstract

Approximate computing is an advanced computational technique that trades the accuracy of computation results for better utilization of system resources. It provides significant benefits for energy-efficient systems and is being considered for high speed and low power nanoscale integrated circuit (IC) designs. It is crucial for ICs to achieve high speed and low power, where some intrinsic errors are acceptable, such as (deep-) machine learning, image processing, communication, and other error-tolerant and cognitive applications. However, approximate computing also introduces security vulnerabilities mainly due to the fact that the uncertain and unpredictable intrinsic errors during approximate execution may be indistinguishable from malicious modification of the input data, the execution process, and the results. In this book chapter, we present a comprehensive analysis of security vulnerabilities in approximate computing. Specifically, the security threats in approximate circuits and approximate testing techniques are deeply investigated and analyzed. A countermeasure, a self-detection technique, to tampering attack is also proposed and an experiment is carried out to evaluate the effectiveness of the proposed method. Experimental results show that the proposed method is effective to the tampering attack.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 129.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Chandrasekharan A, Eggersglüß S, Große D, Drechsler R. Approximation-aware testing for approximate circuits. In: Proceedings of the 23rd Asia and South pacific design automation conference (ASP-DAC); 2018. pp 239–44

    Google Scholar 

  2. Chen L, Han J, Liu W, Lombardi F. Design of approximate unsigned integer non-restoring divider for inexact computing. In: Proceedings of the ACM 25th edition on Great Lakes symposium on VLSI (GLSVLSI); 2015. pp 51–6

    Google Scholar 

  3. Chen L, Lombardi F, Montuschi P, Han J, Liu W. Design of approximate high-radix dividers by inexact binary signed-digit addition. In: Proceedings of the great lakes symposium on VLSI (GLSVLSI); 2017. pp 293–298

    Google Scholar 

  4. Dou Y, Yu S, Gu C, O’Neill M, Wang C, Liu W. Security analysis of hardware trojans on approximate circuits. In: Proceedings of the 2020 on great lakes symposium on VLSI. GLSVLSI ’20. New York, NY: Association for Computing Machinery; 2020. pp 315–320

    Google Scholar 

  5. Fleischer B, Shukla S, Ziegler M, Silberman J, Oh J, Srinivasan V, Choi J, Mueller S, Agrawal A, Babinsky T, Cao N, Chen C, Chuang P, Fox T, Gristede G, Guillorn M, Haynie H, Klaiber M, Lee D, Lo S, Maier G, Scheuermann M, Venkataramani S, Vezyrtzis C, Wang N, Yee F, Zhou C, Lu P, Curran B, Chang L, Gopalakrishnan K. A scalable multi-teraOPS deep learning processor core for AI trainina and inference. In: 2018 IEEE symposium on VLSI circuits; 2018. pp 35–6

    Google Scholar 

  6. Gupta V, Mohapatra D, Raghunathan A, Roy K. Low-power digital signal processing using approximate adders. IEEE Transact Comput-Aid Des Integr Circ Syst. 2013; 32(1):124–137

    Article  Google Scholar 

  7. Han J, Orshansky M. Approximate computing: An emerging paradigm for energy-efficient design. In: Proceedings of the 18th IEEE European test symposium (ETS), May 2013; pp 1–6

    Google Scholar 

  8. Hruska J. Nvidia’s CEO Declares Moore’s Law Dead; 2017

    Google Scholar 

  9. International Technology Roadmap for Semiconductors. Last accessed 16 January 2018

    Google Scholar 

  10. Islam SA. On the (IN) security of approximate computing synthesis (2019). Preprint. arXiv:1912.01209

    Google Scholar 

  11. Jiang H, Liu C, Liu L, Lombardi F, Han J. A review, classification, and comparative evaluation of approximate arithmetic circuits. ACM J Emerg Technol Comput Syst 2017;13(4):60:1–60:34

    Google Scholar 

  12. Jouppi N, Young C, Patil N, Patterson D, Agrawal G, Bajwa R, Bates S, Bhatia S, Boden N, Borchers A. In-datacenter performance analysis of a tensor processing unit. In: Proceedings of the 44th annual international symposium on computer architecture (ISCA); 2017. pp 1–12

    Google Scholar 

  13. Liu W, Qian L, Wang C, Jiang H, Han J, Lombardi F. Design of approximate radix-4 Booth multipliers for error-tolerant computing. IEEE Trans Comput 2017;66(8):1435–41

    Article  MathSciNet  Google Scholar 

  14. Liu W, Xu J, Wang D, Wang C, Montuschi P, Lombardi F. Design and evaluation of approximate logarithmic multipliers for low power error-tolerant applications. IEEE Trans Circ Syst I: Regul Pap 2018;65(9):2856–68

    Google Scholar 

  15. Liu W, Cao T, Yin P, Zhu Y, Wang C, Swartzlander EE Jr, Lombardi F. Design and analysis of approximate redundant binary multipliers. IEEE Trans Comput 2019;68(6):804–819

    Article  MathSciNet  Google Scholar 

  16. Liu W, Gu C, O’Neill M, Qu G, Montuschi P, Lombardi F. Security in approximate computing and approximate computing for security: challenges and opportunities. Proc IEEE 2020;108(12):2214–2231

    Article  Google Scholar 

  17. Liu W, Gu C, Qu G, O’Neill M. Approximate computing and its application to hardware security. New York: Springer; 2018. pp 43–67

    Google Scholar 

  18. Liu W, Lombardi F, Shulte M. A retrospective and prospective view of approximate computing [point of view. In: Proceedings of the IEEE; 2020

    Google Scholar 

  19. Mittal S. A survey of techniques for approximate computing. ACM Comput Surv 2016;48(4):62:1–62:33

    Google Scholar 

  20. Regazzoni F, Alippi C, Polian I. Security: the dark side of approximate computing? In: Proceedings of the IEEE/ACM international conference on computer-aided design (ICCAD); 2018. pp 1–6

    Google Scholar 

  21. Tetramax (2018). https://www.synopsys.com

  22. Traiola M, Virazel A, Girard P, Barbareschi M, Bosio A. On the comparison of different ATPG approaches for approximate integrated circuits. In: IEEE 21st international symposium on design and diagnostics of electronic circuits systems (DDECS); 2018. pp 85–90.

    Google Scholar 

  23. Traiola M, Virazel A, Girard P, Barbareschi M, Bosio A. Maximizing yield for approximate integrated circuits. In: Design, automation test in Europe conference exhibition (DATE); 2020. pp 810–815

    Google Scholar 

  24. Traiola M, Virazel A, Girard P, Barbareschi M, Bosio A. On the comparison of different ATPG approaches for approximate integrated circuits. In: 2018 IEEE 21st international symposium on design and diagnostics of electronic circuits & systems (DDECS). New York: IEEE; 2018. pp 85–90

    Chapter  Google Scholar 

  25. Venkataramani S, Chippa VK, Chakradhar ST, Roy K, Raghunathan A. Quality programmable vector processors for approximate computing. In: Proceedings of the 46th annual IEEE/ACM international symposium on microarchitecture (MICRO); 2013. pp. 1–12.

    Google Scholar 

  26. Xu Q, Mytkowicz T, Kim N. Approximate computing: a survey. IEEE Des Test 2016;33(1):8–22

    Article  Google Scholar 

  27. Xue M, Gu C, Liu W, Yu S, O’Neill M. Ten years of hardware trojans: a survey from the attacker’s perspective. IET Comput Digit Tech. 2020;14(6):231–46

    Article  Google Scholar 

  28. Yellu P, Boskov N, Kinsy MA, Yu Q. Security threats in approximate computing systems. In: Proceedings of the great lakes symposium on VLSI (GLSVLSI); 2019. pp 387–392

    Google Scholar 

  29. Yellu P, Monjur MR, Kammerer T, Xu D, Yu Q. Security threats and countermeasures for approximate arithmetic computing. In: 2020 25th Asia and South pacific design automation conference (ASP-DAC); 2020

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Secure Information Technologies (CSIT), Queen’s University Belfast, Belfast, UK

    Chongyan Gu & Máire O’Neill

  2. College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing, China

    Yuqin Dou & Weiqiang Liu

Authors
  1. Chongyan Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuqin Dou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Weiqiang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Máire O’Neill
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chongyan Gu .

Editor information

Editors and Affiliations

  1. Nanjing University of Aeronautics and Astronautics, Nanjing, China

    Weiqiang Liu

  2. Northeastern University, Boston, MA, USA

    Fabrizio Lombardi

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Gu, C., Dou, Y., Liu, W., O’Neill, M. (2022). Security Vulnerabilities and Countermeasures for Approximate Circuits. In: Liu, W., Lombardi, F. (eds) Approximate Computing. Springer, Cham. https://doi.org/10.1007/978-3-030-98347-5_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-98347-5_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-98346-8

  • Online ISBN: 978-3-030-98347-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation