arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1604.04206cs.DCcs.CR
收藏

关于并行Hash函数最优树的注记

Note on Optimal Trees for Parallel Hash Functions

Kevin Atighehchi

摘要:

最近的一项工作展示了我们如何优化基于树的操作模式,以实现1率哈希函数。特别是,一个算法和一个定理,提出了一个很好的树拓扑结构,以优化运行时间和处理器的数量在每一步的计算。因为本文只处理树叶深度相同的树,所以节省的计算资源数量只对这一类树是完全最优的。在这篇文章中,我们解决了更一般的情况,并描述了一个简单的算法,从这样的树拓扑结构开始,重新设计它,以进一步减少处理器的数量和散列消息的总工作量。

英文摘要:

A recent work shows how we can optimize a tree based mode of operation for a rate 1 hash function. In particular, an algorithm and a theorem are presented for selecting a good tree topology in order to optimize both the running time and the number of processors at each step of the computation. Because this paper deals only with trees having their leaves at the same depth, the number of saved computing resources is perfectly optimal only for this category of trees. In this note, we address the more general case and describe a simple algorithm which, starting from such a tree topology, reworks it to further reduce the number of processors and the total amount of work done to hash a message.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑