• DocumentCode
    245782
  • Title

    A Recursive Algorithm for General Hash Chain Traversal

  • Author

    Yi-Wen Peng ; Wei-Mei Chen

  • Author_Institution
    Dept. of Electron. & Comput. Eng., Nat. Taiwan Univ. of Sci. & Technol., Taipei, Taiwan
  • fYear
    2014
  • fDate
    19-21 Dec. 2014
  • Firstpage
    1171
  • Lastpage
    1174
  • 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.
  • Keywords
    cryptography; computation efficiency; computational costs; cryptography; general hash chain traversal; hash function evaluations; one-way function; recursive algorithm; resource-constrained environments; storage cells; Ad hoc networks; Computational efficiency; Conferences; Cryptography; Partitioning algorithms; Scientific computing; Upper bound; algorithm; cryptography; hash chain;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Science and Engineering (CSE), 2014 IEEE 17th International Conference on
  • Conference_Location
    Chengdu
  • Print_ISBN
    978-1-4799-7980-6
  • Type

    conf

  • DOI
    10.1109/CSE.2014.228
  • Filename
    7023738
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=245782