一般哈希链遍历的递归算法

2014 IEEE 17th International Conference on Computational Science and Engineering Pub Date : 2014-12-19 DOI:10.1109/CSE.2014.228

Yi-Wen Peng, Wei-Mei Chen

{"title":"一般哈希链遍历的递归算法","authors":"Yi-Wen Peng, Wei-Mei Chen","doi":"10.1109/CSE.2014.228","DOIUrl":null,"url":null,"abstract":"A hash chain is a popular tool for improving the efficiency of several cryptographic applications. In spite of the computation efficiency of one-way function, the performance issue is a challenging research topic for chains with long length in resource-constrained environments. We propose a recursive algorithm of hash chain traversal for arbitrary length n with [log2n] storage cells and the computational costs of our solution are less than 12 n log2 n hash function evaluations.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Recursive Algorithm for General Hash Chain Traversal\",\"authors\":\"Yi-Wen Peng, Wei-Mei Chen\",\"doi\":\"10.1109/CSE.2014.228\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A hash chain is a popular tool for improving the efficiency of several cryptographic applications. In spite of the computation efficiency of one-way function, the performance issue is a challenging research topic for chains with long length in resource-constrained environments. We propose a recursive algorithm of hash chain traversal for arbitrary length n with [log2n] storage cells and the computational costs of our solution are less than 12 n log2 n hash function evaluations.\",\"PeriodicalId\":258990,\"journal\":{\"name\":\"2014 IEEE 17th International Conference on Computational Science and Engineering\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 17th International Conference on Computational Science and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSE.2014.228\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 17th International Conference on Computational Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSE.2014.228","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

散列链是一种流行的工具，用于提高几种加密应用程序的效率。尽管单向函数的计算效率很高，但对于资源受限环境下的长链，性能问题是一个具有挑战性的研究课题。我们提出了一个任意长度n的递归哈希链遍历算法，存储单元为[log2n]，我们的解决方案的计算成本小于12 n log2n哈希函数计算。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Recursive Algorithm for General Hash Chain Traversal

A hash chain is a popular tool for improving the efficiency of several cryptographic applications. In spite of the computation efficiency of one-way function, the performance issue is a challenging research topic for chains with long length in resource-constrained environments. We propose a recursive algorithm of hash chain traversal for arbitrary length n with [log2n] storage cells and the computational costs of our solution are less than 12 n log2 n hash function evaluations.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2014 IEEE 17th International Conference on Computational Science and Engineering

自引率

0.00%

发文量