Novel Hash Function With Provable Resistance To Differential Attacks
    6.
    发明申请
    Novel Hash Function With Provable Resistance To Differential Attacks 有权
    新颖的哈希功能可以抵御差别攻击

    公开(公告)号:US20100104095A1

    公开(公告)日:2010-04-29

    申请号:US12259588

    申请日:2008-10-28

    IPC分类号: H04L9/06

    摘要: A system and method for coding data to help resist differential attacks. Data in m columns may be initialized to an initialized value. One new column of data may be mixed with a new input word and input to an advanced mixer. The advanced mixer may include linear mixing having indexed bytes and performing of exclusive-OR operation and transposing. An output of the advanced mixer may be a new m column state. A value of m could be 0 through 30. The value of m may have a preferred range of 27 through 36. Systems to implement the foregoing method are also described.

    摘要翻译: 用于编码数据以帮助抵御差别攻击的系统和方法。 m列中的数据可以初始化为初始化值。 一个新的数据列可以与新的输入字混合并输入到高级混音器。 高级混合器可以包括具有索引字节的线性混合和执行异或运算和转置。 高级混合器的输出可以是新的m列状态。 m的值可以是0到30.M的值可以具有27至36的优选范围。还描述了实现上述方法的系统。

    Hash function with provable resistance to differential attacks
    7.
    发明授权
    Hash function with provable resistance to differential attacks 有权
    哈希功能具有可抵抗差分攻击的抵抗能力

    公开(公告)号:US08121286B2

    公开(公告)日:2012-02-21

    申请号:US12259588

    申请日:2008-10-28

    IPC分类号: H04K1/00 G06F11/30

    摘要: A system and method for coding data to help resist differential attacks. Data in m columns may be initialized to an initialized value. One new column of data may be mixed with a new input word and input to an advanced mixer. The advanced mixer may include linear mixing having indexed bytes and performing of exclusive-OR operation and transposing. An output of the advanced mixer may be a new m column state. A value of m could be 0 through 30. The value of m may have a preferred range of 27 through 36. Systems to implement the foregoing method are also described.

    摘要翻译: 用于编码数据以帮助抵御差别攻击的系统和方法。 m列中的数据可以初始化为初始化值。 一个新的数据列可以与新的输入字混合并输入到高级混音器。 高级混合器可以包括具有索引字节的线性混合和执行异或运算和转置。 高级混合器的输出可以是新的m列状态。 m的值可以是0到30.M的值可以具有27至36的优选范围。还描述了实现上述方法的系统。

    Biometric authentication system with encrypted models
    8.
    发明授权
    Biometric authentication system with encrypted models 有权
    具有加密模型的生物识别认证系统

    公开(公告)号:US06317834B1

    公开(公告)日:2001-11-13

    申请号:US09240214

    申请日:1999-01-29

    IPC分类号: H04L932

    摘要: A method of performing biometric authentication of a person's identity including a biometric template prior to storing it in a biometric database. The encryption algorithm encrypts the biometric template using a pass-phrase, known only to the individual, to generate the cryptographic key used to store and retrieve the biometric template. When an individual wishes to access a secured resource, he must be authenticated by providing an identifier which is used to retrieve the appropriate record. He must also provide the correct password to allow the system to decrypt the model.

    摘要翻译: 在将生物测定模板存储在生物特征数据库中之前,对包括生物特征模板的人的身份进行身份认证的方法。 加密算法使用仅针对个人知道的密码短语加密生物特征模板,以生成用于存储和检索生物特征模板的加密密钥。 当个人希望访问安全资源时,他必须通过提供用于检索适当记录的标识符进行身份验证。 他还必须提供正确的密码,让系统解密模型。

    Efficient stream cipher system and method
    9.
    发明授权
    Efficient stream cipher system and method 有权
    高效的流密码系统和方法

    公开(公告)号:US07236592B2

    公开(公告)日:2007-06-26

    申请号:US10066041

    申请日:2002-02-01

    IPC分类号: H04K1/00 H04K1/04 H04L9/00

    CPC分类号: H04L9/0668 H04L2209/043

    摘要: A computer system and method generates a random output stream of bits. The system comprises an initial evolving state produced from one or more initial keys, one or more round functions, and one or more mask tables. Each round function is part of a step in a sequence of steps. Each step applies the respective round function to a current evolving state to produce a respective new evolving state for processing by the next step in the sequence. The first step in the sequence starts b processing the initial evolving state. The mask tables are produced from one or more of the initial keys. Each of the mask tables has one or more masks. The masks are combined, in each respective step, with the respective new evolving state in a combination operation to create a respective step output. The random output stream bits is a concatenation of each of the respective step outputs. In one preferred embodiment, one or more of the masks in the mask tables are replaced by one or more replacement masks after a number of combination operations. The replacement masks not being linear combinations of prior masks. In an alternative embodiment, there are two or more mask tables produced from one or more of the initial keys. One or more of the masks from each table is combined, in each respective step, with the respective new evolving state in a combination operation to create a respective step output. There may or may not be replacement of the masks in this embodiment.

    摘要翻译: 计算机系统和方法产生随机输出的比特流。 该系统包括从一个或多个初始密钥,一个或多个循环函数和一个或多个掩码表产生的初始演进状态。 每个循环函数是步骤序列的一部分。 每个步骤将相应的回合函数应用于当前演进状态以产生用于通过该序列中的下一步进行处理的相应的新演进状态。 序列的第一步开始b处理初始进化状态。 掩模台由一个或多个初始密钥产生。 每个掩码表都有一个或多个掩码。 在每个相应步骤中,将掩模与组合操作中的相应新演进状态相结合,以创建相应的步进输出。 随机输出流比特是各个步进输出中的每一个的级联。 在一个优选实施例中,在多个组合操作之后,掩模表中的一个或多个掩模被一个或多个替换掩模替换。 替换掩码不是先前掩码的线性组合。 在替代实施例中,存在从一个或多个初始密钥产生的两个或更多个掩码表。 来自每个表的一个或多个掩模在每个相应的步骤中与组合操作中的相应的新的演进状态相结合以产生相应的步骤输出。 在本实施例中可以或可以不更换面罩。

    Non-interactive hierarchical identity-based key-agreement
    10.
    发明授权
    Non-interactive hierarchical identity-based key-agreement 失效
    基于非交互式层次化身份的密钥协商

    公开(公告)号:US08422681B2

    公开(公告)日:2013-04-16

    申请号:US12043755

    申请日:2008-03-06

    IPC分类号: H04L29/06

    摘要: A pairwise key-agreement scheme is provided for creating key agreements non-interactively between pairs of nodes disposed in a hierarchy of nodes. The scheme is non-interactive so that any two nodes can agree on a shared secret key without interaction. In addition, the scheme is identity-based so that any given node only needs to know the identity of peer nodes to compute the shared secret key. All of the nodes are arranged in a hierarchy where an intermediate node in the hierarchy can derive the secret keys for each of its children from its own secret key and the identity of the child. Accordingly, the scheme is fully resilient against compromise of any number of leaves in the hierarchy and of a threshold number of nodes in the upper levels of the hierarchy. The scheme is well-suited for environments such as mobile ad-hoc networks (MANETs), which are very dynamic, have acute bandwidth-constraints and have many nodes are vulnerable to compromise.

    摘要翻译: 提供了成对密钥协商方案,用于在节点层次结构中的成对节点之间非交互地创建密钥协议。 该方案是非交互式的,因此任何两个节点都可以在没有交互的情况下对共享秘密密钥达成一致。 此外,该方案是基于身份的,使得任何给定节点仅需要知道对等节点的身份来计算共享密钥。 所有的节点被排列在层次结构中,其中层次结构中的中间节点可以从其自己的秘密密钥和孩子的身份导出其每个子项的秘密密钥。 因此,该方案完全可抵御层次结构中任何数量的叶片和层次结构的较高层中的阈值数量的节点的折中。 该方案非常适合诸如移动自组织网络(MANET)这样非常动态的环境,具有严格的带宽限制,并且许多节点容易受到折中。