Energy scalable universal hashing

被引:34
|
作者
Kaps, JP [1 ]
Yüksel, K [1 ]
Sunar, B [1 ]
机构
[1] Worcester Polytech Inst, Dept Elect & Comp Engn, CRIS Labs, Worcester, MA 01609 USA
基金
美国国家科学基金会;
关键词
universal hashing; provable security; message authentication codes; scalability; low-power; low-energy;
D O I
10.1109/TC.2005.195
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Message Authentication Codes ( MACs) are valuable tools for ensuring the integrity of messages. MACs may be built around a universal hash function (NH) which was explored in the construction of UMAC. In this paper, we use a variation on NH called WH. WH reaches optimality in the sense that it is universal with half the hash length of NH and it achieves perfect serialization in hardware implementation. We achieved substantial power savings of up to 59 percent and a speedup of up to 7.4 times over NH. Moreover, we show how the technique of multihashing and the Toeplitz approach can be combined to reduce the power and energy consumption even further while maintaining the same security level with a very slight increase in the amount of the key material. At low frequencies, the power and energy reductions are achieved simultaneously while keeping the hashing time constant. We developed formulae for estimation of the leakage and dynamic power consumptions as well as the energy consumption based on the frequency and the Toeplitz parameter t. We introduce a powerful method for scaling WH according to specific energy and power consumption requirements. Our implementation of WH-16 consumes only 2.95 mu W at 500 kHz. It can therefore be integrated into a self-powered device.
引用
收藏
页码:1484 / 1495
页数:12
相关论文
共 50 条
  • [1] Stadium Hashing: Scalable and Flexible Hashing on GPUs
    Khorasani, Farzad
    Belviranli, Mehmet E.
    Gupta, Rajiv
    Bhuyan, Laxmi N.
    [J]. 2015 INTERNATIONAL CONFERENCE ON PARALLEL ARCHITECTURE AND COMPILATION (PACT), 2015, : 63 - 74
  • [2] EXTENDIBLE HASHING WITH UNIVERSAL CLASS OF HASHING FUNCTIONS
    Sridevi, G. M.
    Ashoka, D., V
    Ramakrishna, M., V
    [J]. INTERNATIONAL JOURNAL ON INFORMATION TECHNOLOGIES AND SECURITY, 2021, 13 (01): : 51 - 66
  • [3] Variationally universal hashing
    Krovetz, Ted
    Rogaway, Phillip
    [J]. INFORMATION PROCESSING LETTERS, 2006, 100 (01) : 36 - 39
  • [4] UNIVERSAL HASHING IN VLSI
    FURER, M
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1988, 319 : 312 - 318
  • [5] Fast Scalable Supervised Hashing
    Luo, Xin
    Nie, Liqiang
    He, Xiangnan
    Wu, Ye
    Chen, Zhen-Duo
    Xu, Xin-Shun
    [J]. ACM/SIGIR PROCEEDINGS 2018, 2018, : 735 - 744
  • [6] Scalable Heterogeneous Translated Hashing
    Wei, Ying
    Song, Yangqiu
    Zhen, Yi
    Liu, Bo
    Yang, Qiang
    [J]. PROCEEDINGS OF THE 20TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING (KDD'14), 2014, : 791 - 800
  • [7] Universal Hashing and Geometric Codes
    Bierbrauer J.
    [J]. Designs, Codes and Cryptography, 1997, 11 (3) : 207 - 221
  • [8] COMBINATORIAL TECHNIQUES FOR UNIVERSAL HASHING
    STINSON, DR
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1994, 48 (02) : 337 - 346
  • [9] UNIVERSAL HASHING AND AUTHENTICATION CODES
    STINSON, DR
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 576 : 74 - 85
  • [10] Dash: Scalable Hashing on Persistent Memory
    Lu, Baotong
    Hao, Xiangpeng
    Wang, Tianzheng
    Lo, Eric
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2020, 13 (08): : 1147 - 1161