PATENT CLAIM ANALYSIS

Application Number: 16110649
Application Type: Utility
Filing Date: 2018-08
Publication Date: 2019-01
Patent Classification: ["713", "193000"]

Abstract:
Techniques are disclosed for efficient computation of consecutive values of one-way chains and other one-way graphs in cryptographic applications. The one-way chain or graph may be a chain of length shaving positions i=1, 2, . . . s each having a corresponding value v i  associated therewith, wherein the value v i  is given by v i =h(v i+1 ), for a given hash function or other one-way function h. An initial distribution of helper values may be stored for the one-way chain of length s, e.g., at positions given by i=2 j  for 0≤j≤log 2  s. A given one of the output values v i  at a current position in the one-way chain may be computed utilizing a first helper value previously stored for another position in the one-way chain between the current position and an endpoint of the chain. After computation of the given output value, the positions of the helper values are adjusted so as to facilitate computation of subsequent output values. Advantageously, a storage-computation product associated with generation of the output values of the one-way chain has a complexity O((log s) 2 ).

Claim (Index 19):
A machine-readable medium for storing one or more programs for use by a processor in generating values of a one-way chain, the processor being coupled to a memory, the memory having a designated amount of storage available for storing values of a one-way chain, the designated amount of available storage being less than that required to store simultaneously all of the values of the one-way chain, the one or more programs when executed causing the processor to perform the steps of:\n storing in the memory a subset of the values of the one-way chain as helper values for facilitating computation of other values of the one-way chain not in the subset; utilizing one of the values in the subset of values to compute one of the other values of the one-way chain not in the subset; generating a cryptographic output determined by the computed value not in the subset; and updating the stored subset of values of the one-way chain so as to replace at least one of the helper values with a new helper value not previously part of the subset.

Metadata:
- Claim Count in Document: 2.0
- Percentile: 96.0
- Lexical Diversity: 2.22826
- Patent Class: 713.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: False
- Related Applications: ['12131404', '09969833', '13302238', '15656549', '15340626']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.4796265068788536
- 35 USC 102 Novelty (BERT): 0.5698070059764688
- Combined Prediction Score: 0.4886445567886152
- Mean Citation Score: 424.581138
- Max Citation Score: 450.34784
- Similarity Product: 425.0424128175736

Labels:
- Claim Label 101: 1
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 1
- Label 101 Adjusted: 1

Dataset: test