skip to main content
10.1145/1084834.1084891acmconferencesArticle/Chapter ViewAbstractPublication PagesesweekConference Proceedingsconference-collections
Article

Power optimization for universal hash function data path using divide-and-concatenate technique

Published:19 September 2005Publication History

ABSTRACT

We present an architecture level low power design technique called divide-and-concatenate for universal hash functions based on the following observations: (i) the power consumption of a w-bit array multiplier and associated universal hash data path decreases as O(w4) if its clock rate remains constant. (ii) two universal hash functions are equivalent if they have the same collision probability property. In the proposed approach we divide a w-bit data path (with collision probability 2-w) into two/four w/2-bit data paths (each with collision probability 2-w/2) and concatenate their results to construct an equivalent w-bit data path (with a collision probability 2-w). A popular low power technique that uses parallel data paths saves 62.10% dynamic power consumption incurring 102% area overhead. In contrast, the divide-and-concatenate technique saves 55.44% dynamic power consumption with only 16% area overhead.

References

  1. S. Halevi and H. Krawczyk. Mmh: Software message authentication in the gbit/second rates. In Workshop on Fast Software Encryption, pages 172--189, 1997.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. J. Black, S. Halevi, H. Krawczyk, T. Krovetz, and P. Rogaway. Umac: Fast and secure message authentication. In Cryptology Conference on Advances in Cryptology, pages 216--233, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. D. A. McGrew. The truncated multi-modular hash function TMMH. In IETF Internet Draft, 2001.]]Google ScholarGoogle Scholar
  4. S.Dharmapurikar, P. Krishnamurthy, T. Sproull, and J. Lockwood. Deep packet inspection using parallel bloom filters. In High Performance Interconnects, pages 614--617, 2003.]]Google ScholarGoogle ScholarCross RefCross Ref
  5. Z. Huang. High-Level Optimization Techniques for Low-Power Multiplier Design. Ph.D. Thesis, University of California at Los Angeles, 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. A. Raghunathan, S. Dey, and N. K. Jha. Glitch analysis and reduction in register transfer level power optimization. In Design Automation Conference, pages 331--336, 1996.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. J. Yu, W. Wu, X. Chen, H. Hsieh, J. Yang, and F. Balarin. Assertion-based design exploration of dvs in network processor architectures. In Design Automation and Test in Europe, pages 92--97, 2005.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. P. Petrov and A. Orailoglu. Low-power instruction bus encoding for embedded processors. IEEE Trans. Very Large Scale Integr. Syst., 12(8):812--826, 2004.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. M. Srivastava and M. Potkonjak. Power optimization in programmable processors and asic implementations of linear systems: Transformation-based approach. In Design Automation Conference, pages 343--348, 1996.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. A. Chandrakasan, S. Sheng, and R. Brodersen. Low-power cmos digital design. IEEE Journal of Solid-State Circuits, 27(4):473--484, 1992.]]Google ScholarGoogle ScholarCross RefCross Ref
  11. J. M. Rabaey. Digital Integrated Circuits: A Design Perspective. Prentice-Hall, Englewood Cliffs, NJ, 1996.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. B. Yang, R. Karri, and D. A. Mcgrew. Divide-and-concatenate: An architecture level optimization technique for universal hash functions. In Design Automation Conference, pages 44--52, 2004.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. P. Rogaway and T. Shrimpton. Cryptographic hash function basics: Definitions, implications, and separations for preimage resistance, second-preimage resistance, and collision resistance. In Fast Software Encryption, pages 371--388, 2004.]]Google ScholarGoogle ScholarCross RefCross Ref
  14. L. Carter and M. Wegman. Universal hash functions. Journal of Computer and System Sciences, 18:143--154, 1979.]]Google ScholarGoogle ScholarCross RefCross Ref
  15. I. Koren. Computer Arithmetic Algorithms. A. K. Peters, Natick, Massachusetts, 2nd Edition, 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. J. R. Black. Message Authentication Codes. Ph.D. Thesis, University of California at Davis, 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Power optimization for universal hash function data path using divide-and-concatenate technique

    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
      CODES+ISSS '05: Proceedings of the 3rd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
      September 2005
      356 pages
      ISBN:1595931619
      DOI:10.1145/1084834

      Copyright © 2005 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: 19 September 2005

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      CODES+ISSS '05 Paper Acceptance Rate50of200submissions,25%Overall Acceptance Rate280of864submissions,32%

      Upcoming Conference

      ESWEEK '24
      Twentieth Embedded Systems Week
      September 29 - October 4, 2024
      Raleigh , NC , USA
    • Article Metrics

      • Downloads (Last 12 months)2
      • Downloads (Last 6 weeks)1

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader