{"schema_version":"1.0","canonical_url":"https://patentable.app/patents/US-8538014","patent":{"patent_number":"US-8538014","title":"Fast computation of one-way hash sequences","assignee":null,"inventors":[],"filing_date":"2008-05-12T00:00:00.000Z","publication_date":"2013-09-17T00:00:00.000Z","cpc_codes":["H04L","H04L","H04L"],"num_claims":18,"abstract":"Some embodiments of the present invention provide a system that computes a target secret St in a sequence of secrets S0 . . . Sn. During operation, the system obtains k hash functions h1, . . . , hk, where h1 is known as the “lowest order hash function”, and hk is known as the “highest order hash function.” Associated with each hash function hi is a seed value seed comprising a pair (seedindexi, seedvaluei). Hash function hi operates on a pair (indexi, valuei) to produce a pair (newindexi, newvaluei), where newindexi>indexi. To compute target secret St, the hash functions are applied successively, starting with the highest order hash function whose associated seed's index value is largest without being greater than t, applying that hash function as many times as possible without having that hash function's output's index value become greater than t, and then applying each successive hash function in turn as many times as possible, until St has been computed. To delete the earliest computable secret in the chain, S1, the new seed for each of the hash functions is computed as follows. Let x=1+index1, (the index of the seed associated with the lowest order hash function). For each hash function hi, if x>indexi, then hi is applied to seedi. If the resulting indexi is greater than indexi+1, then (indexi+1, valuei+1) associated with hashi+1 is copied into the (index, value) associated with hashi. Otherwise, seed is replaced by hi(seedi)."},"analysis":{"summary":null,"layman_explanation":null,"technical_analysis":null,"business_analysis":null,"faqs":null,"topics":[],"tech_cluster":null},"seo":{"title":"Fast computation of one-way hash sequences","description":"Some embodiments of the present invention provide a system that computes a target secret St in a sequence of secrets S0 . . . Sn. During operation, the system obtains k hash functions h1, . . . , hk, ","keywords":[]},"attribution":{"source":"Patentable","source_url":"https://patentable.app","canonical_url":"https://patentable.app/patents/US-8538014","license":"CC-BY-4.0-like","license_terms":"AI-generated analysis on this page (summary, layman_explanation, technical_analysis, business_analysis, faqs) may be reused with attribution and a visible link back to the canonical URL above. Patent abstracts, claims, and bibliographic data are USPTO public domain.","required_link":"https://patentable.app/patents/US-8538014","citation_suggestion":"Patentable. \"Fast computation of one-way hash sequences\" (US-8538014). https://patentable.app/patents/US-8538014","copyright_holder":"Nomic Interactive Technology LLC"},"links":{"html":"https://patentable.app/patents/US-8538014","json":"https://patentable.app/api/llm-context/US-8538014","site":"https://patentable.app","llms_txt":"https://patentable.app/llms.txt"},"generated_at":"2026-05-30T17:14:00.814Z"}