-
公开(公告)号：US08036378B2
公开(公告)日：2011-10-11
申请号：US12116770
申请日：2008-05-07
IPC分类号： H04L9/28
CPC分类号： H04L9/3236 , H04L2209/60
摘要： Disclosed herein are systems, methods and computer readable media for performing authentication. The proposed scheme utilizes new algorithms that introduce randomness using a physical value for authentication. An exemplary method includes sharing an initial state value S(0) with a sender and a receiver, generating a sender S(t, v) based on a parameter t and an identifier v and based at least in part on the value S(0). The method includes generating a receiver S(t, v) from S(0) based on the parameter t and the identifier v wherein the parameter t is related to a physical value in authenticating the identifier v based on a comparison of the sender S(t, v) and the receiver S(t, v). The process of generating the sender S(t, v) and the receiver S(t, v) includes a random variable generated by a process such as by a random number generator, the Brownian Motion or Wiener Process. Other embodiments do not use the physical value for authentication.
摘要翻译： 本文公开了用于执行认证的系统，方法和计算机可读介质。 所提出的方案利用使用物理值引入随机性的新算法进行认证。 一种示例性方法包括与发送者和接收者共享初始状态值S（0），基于参数t和标识符v生成发送者S（t，v），并至少部分地基于值S（0 ）。 该方法包括基于参数t和标识符v从S（0）生成接收器S（t，v），其中参数t与鉴定符v的物理值有关，基于发送器S的比较（ t，v）和接收机S（t，v）。 生成发送方S（t，v）和接收方S（t，v）的过程包括由诸如随机数生成器Brownian Motion或Wiener进程之类的处理生成的随机变量。 其他实施例不使用物理值进行认证。
-
公开(公告)号：US20100115230A1
公开(公告)日：2010-05-06
申请号：US12263293
申请日：2008-10-31
IPC分类号： G06F12/08
CPC分类号： G06F7/723 , G06F2207/7257 , H04L9/0643
摘要： Aspects relate to systems and methods for implementing a hash function using a stochastic and recurrent process, and performing arithmetic operations during the recurrence on portions of a message being hashed. In an example method, the stochastic process is a Galton-Watson process, the message is decomposed into blocks, and the method involves looping for a number of blocks in the message. In each loop, a current hash value is determined based on arithmetic performed on a previous hash value and some aspect of a current block. The arithmetic performed can involve modular arithmetic, such as modular addition and exponentiation. The algorithm can be adjusted to achieve qualities including a variable length output, or to perform fewer or more computations for a given hash. Also, randomizing elements can be introduced into the arithmetic, avoiding a modular reduction until final hash output production.
摘要翻译： 方面涉及用于使用随机和复现过程来实现散列函数的系统和方法，以及在散列的消息的部分上的重复期间执行算术运算。 在一个示例方法中，随机过程是Galton-Watson过程，消息被分解成块，并且该方法涉及在消息中循环多个块。 在每个循环中，基于对先前哈希值和当前块的某个方面执行的算术来确定当前哈希值。 执行的算术可以涉及模数运算，例如模块加法和乘法运算。 可以调整算法以实现包括可变长度输出的质量，或者为给定散列执行更少或更多的计算。 此外，可以将随机化元素引入算术，避免模块化减少直到最终哈希输出生成。
-
公开(公告)号：US20100100947A1
公开(公告)日：2010-04-22
申请号：US12255315
申请日：2008-10-21
CPC分类号： H04L9/3271 , H04L2209/80
摘要： Aspects relate to systems and methods implementing a scheme allowing a Verifier (V) to authenticate a Prover (P). The scheme comprises pre-sharing between V and P a graph of nodes. Each node is associated with a polynomial. V sends P data comprising data for selecting a polynomial of the graph, such as traversal data for proceeding from a known node to another node, a time interval, and a number k. P uses the time interval in an evaluation of the polynomial. P then uses the evaluation as a λ in a Poisson distribution, and determines a value related to a probability that a number of occurrences of an event equals k. P sends the determined value to V. V performs a similar determination to arrive at a comparison value. P authenticates V if the separately determined values match, or otherwise meet expectations. The process can be repeated to increase confidence in authentication.
摘要翻译： 方面涉及实现允许Verifier（V）验证Prover（P）的方案的系统和方法。 该方案包括在V和P之间预先共享节点图。 每个节点与多项式相关联。 V发送包括用于选择图形的多项式的数据的P数据，例如用于从已知节点进行到另一个节点的遍历数据，时间间隔和数量k。 P在多项式的评估中使用时间间隔。 P然后将评估用作泊松分布中的λ，并且确定与事件的发生次数等于k的概率相关的值。 P将确定的值发送到V.V执行类似的确定以得到比较值。 如果单独确定的值匹配，则P验证V，否则满足期望。 可以重复该过程以增加认证的置信度。
-
-
搜索结果
23 条记录 (耗时 0.015 秒)
