安全哈希算法-256引擎吞吐量改进的技术方案

Flavius Opritoiu, Sorin Liviu Jurj, M. Vladutiu
{"title":"安全哈希算法-256引擎吞吐量改进的技术方案","authors":"Flavius Opritoiu, Sorin Liviu Jurj, M. Vladutiu","doi":"10.1109/SIITME.2017.8259881","DOIUrl":null,"url":null,"abstract":"This article describes a set of techniques for improving the performance of an Secure Hash Algorithm 256 (SHA-256) hardware implementation. The proposed solution reduces the latency incurred for updating the intermediate hash values and relies on using combinational tree structures of CSAs interconnected in a Wallace tree manner for multi-operand addition. Furthermore, the paper investigates the throughout improvement provided by a combined implementation of architecture's binary adders with the round functions used by the hash computation process. The proposed acceleration techniques can be adapted to the other members of the SHA-2 family of algorithms. The architecture represents a case study for hardware optimization based on different combinational structures for binary addition and the effect of the carry propagate layer on the overall performance. The synthesis results of the proposed designs are provided as support for the performance analysis presented in this work.","PeriodicalId":138347,"journal":{"name":"2017 IEEE 23rd International Symposium for Design and Technology in Electronic Packaging (SIITME)","volume":"161 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Technological solutions for throughput improvement of a Secure Hash Algorithm-256 engine\",\"authors\":\"Flavius Opritoiu, Sorin Liviu Jurj, M. Vladutiu\",\"doi\":\"10.1109/SIITME.2017.8259881\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article describes a set of techniques for improving the performance of an Secure Hash Algorithm 256 (SHA-256) hardware implementation. The proposed solution reduces the latency incurred for updating the intermediate hash values and relies on using combinational tree structures of CSAs interconnected in a Wallace tree manner for multi-operand addition. Furthermore, the paper investigates the throughout improvement provided by a combined implementation of architecture's binary adders with the round functions used by the hash computation process. The proposed acceleration techniques can be adapted to the other members of the SHA-2 family of algorithms. The architecture represents a case study for hardware optimization based on different combinational structures for binary addition and the effect of the carry propagate layer on the overall performance. The synthesis results of the proposed designs are provided as support for the performance analysis presented in this work.\",\"PeriodicalId\":138347,\"journal\":{\"name\":\"2017 IEEE 23rd International Symposium for Design and Technology in Electronic Packaging (SIITME)\",\"volume\":\"161 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE 23rd International Symposium for Design and Technology in Electronic Packaging (SIITME)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIITME.2017.8259881\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 23rd International Symposium for Design and Technology in Electronic Packaging (SIITME)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIITME.2017.8259881","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文描述了一组用于提高安全哈希算法256 (SHA-256)硬件实现性能的技术。提出的解决方案减少了更新中间哈希值的延迟,并依赖于使用以Wallace树方式互连的csa组合树结构进行多操作数加法。此外,本文还研究了体系结构的二进制加法器与哈希计算过程中使用的round函数的组合实现所提供的整体改进。提出的加速技术可以适用于SHA-2算法家族的其他成员。该体系结构代表了基于不同二进制加法组合结构的硬件优化以及进位传播层对整体性能的影响的案例研究。提出的设计的综合结果为本工作中提出的性能分析提供了支持。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Technological solutions for throughput improvement of a Secure Hash Algorithm-256 engine
This article describes a set of techniques for improving the performance of an Secure Hash Algorithm 256 (SHA-256) hardware implementation. The proposed solution reduces the latency incurred for updating the intermediate hash values and relies on using combinational tree structures of CSAs interconnected in a Wallace tree manner for multi-operand addition. Furthermore, the paper investigates the throughout improvement provided by a combined implementation of architecture's binary adders with the round functions used by the hash computation process. The proposed acceleration techniques can be adapted to the other members of the SHA-2 family of algorithms. The architecture represents a case study for hardware optimization based on different combinational structures for binary addition and the effect of the carry propagate layer on the overall performance. The synthesis results of the proposed designs are provided as support for the performance analysis presented in this work.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信