skip to main content
10.1145/1366110.1366176acmconferencesArticle/Chapter ViewAbstractPublication PagesglsvlsiConference Proceedingsconference-collections
research-article

A linear programming formulation for security-aware gate sizing

Published:04 May 2008Publication History

ABSTRACT

Differential power analysis (DPA) has been shown to be the dominant type of side-channel attacks that significantly jeopardize the security in integrated circuits. It has been shown that the data, the functional unit operations as well as the internal micro-architectures can be detected through current and power analysis. Subsequently, different CMOS logic styles have been proposed in the literature for performing computations in such a manner that the current and power signatures can be concealed through reduction of the variance in transient power dissipation. In this work, we propose a gate sizing formulation based on traditional static CMOS standard cells that improves the security of the circuits while maintaining low overheads in terms of area, power and delay. The proposed algorithm considers all disjoint paths from primary inputs to the primary outputs, performing gate sizing with the objective of balancing the switched path capacitances among the various paths making it difficult to extract power or current signatures through current or power profiling. Further, we show that the path based security aware gate sizing formulation is NP-complete and propose a greedy approximation algorithm based on linear programming. The proposed algorithm has been implemented and validated on the ISCAS85 benchmarks and the experimental results indicate a reduction of the variance of transient dynamic power by about 40% with very low overhead in terms of delay, area and power.

References

  1. M. Berkelaar and J. Jess. Gate sizing in mos digital circuits with linear programming. Proc. of EDAC, pages 217--221, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. J. Fishburn and A. Dunlop. Tilos: A posynomial programming approach to transistor sizing. Proc. of ICCAD, pages 326--328, 1985.Google ScholarGoogle Scholar
  3. N. Hanchate and N. Ranganathan. Simultaneous interconnect delay and crosstalk noise optimization through gate sizing using game theory. Trans. on Computers, 55(8):1011--1023, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. P. Kocher, J. Jaffe, and B. Jun. Differential power analysis. Proc. of Intl. Cryptology Conf. on Advances in Cryptology, pages 388--397, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. O. Kommerling and M. Kuhn. Design principles for tamper-resistant smartcard processors. Workshop on Smartcard Technology, pages 9--20, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. V. Mahalingam, N. Ranganathan, and J. Harlow III. A novel approach for variation aware power minimization during gate sizing. Proc. of ISLPED, pages 174--179, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. M. Mani and M. Orshansky. A new statistical optimization algorithm for gate sizing. Proc. of ICCD, pages 272--277, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. A. Murugavel and N. Ranganathan. Gate sizing and buffer insertion using economic models for power optimization. Proc. of Intl. Conf. on VLSI Design, pages 195--200, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. S. Ravi, A. Raghunathan, P. Kocher, and S. Hattangady. Security in embedded systems: Design challenges. Trans. on Embedded Computing Systems, pages 361--391, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. S. Sapatnekar, V. Rao, and P. Vaidya. An exact solution to the transistor sizing problem for cmos circuits using convex optimization. Trans. on CAD, 12(11):1621--1634, 1993.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. Singh, V. Nookala, Z. Luo, and S. Sapatnekar. Robust gate sizing by geometric programming. Proc. of DAC, pages 315--320, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. D. Sinha and H. Zhou. Gate sizing for crosstalk reduction under timing constraints by lagrangian relaxation. Proc. of ICCAD, pages 14--19, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. K. Tiri and I. Verbauwhede. A dynamic and differential cmos logic with signal independent power consumption to withstand differential power analysis on smart cards. Proc. of Conf. of Solid--State Circuits, 2002.Google ScholarGoogle Scholar
  14. K. Tiri and I. Verbauwhede. A logic level design methology for a secure dpa resistant asic or fpga implementation. Proc. of DATE, pages 246--251, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. K. Tiri and I. Verbauwhede. A digital design flow for secure integrated circuits. Trans. on CAD, 25(7):1197--1208, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. X. Yang and K. Saluja. Combating nbti degradation via gate sizing. Proc. of ISQED, pages 47--52, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Q. Zhou and K. Mohanram. Gate sizing to radiation harden combinational logic. Trans. on CAD, 25(1):155--166, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A linear programming formulation for security-aware gate sizing

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          GLSVLSI '08: Proceedings of the 18th ACM Great Lakes symposium on VLSI
          May 2008
          480 pages
          ISBN:9781595939999
          DOI:10.1145/1366110

          Copyright © 2008 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 4 May 2008

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate312of1,156submissions,27%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader