专利名称：Methods and apparatus for efficient
computation of one-way chains incryptographic applications
发明人：Bjorn Markus Jakobsson申请号：US15656549申请日：20170721公开号：US10083308B2公开日：20180925
专利附图：
摘要：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 s having positions i=1, 2, . . . s each having a correspondingvalue vassociated therewith, wherein the value vis given by v=h (v), for a given hashfunction or other one-way function h. An initial distribution of helper values may bestored for the one-way chain of length s, e.g., at positions given by i=2for 0≤j≤logs. Agiven one of the output values vat a current position in the one-way chain may becomputed 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 computationof the given output value, the positions of the helper values are adjusted so as tofacilitate computation of subsequent output values. Advantageously, a storage-computation product associated with generation of the output values of the one-waychain has a complexity O((log s)).
申请人：Crypto Research, LLC
地址：Saratoga CA US
国籍：US
代理机构：Ryan, Mason & Lewis, LLP
更多信息请下载全文后查看
因篇幅问题不能全部显示，请点此查看更多更全内容