利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

39 条记录 (耗时 0.03 秒)

    Accelerated Verification of Digital Signatures and Public Keys
    4.
    发明申请
    Accelerated Verification of Digital Signatures and Public Keys 有权
    加速验证数字签名和公钥

    公开(公告)号：US20120230494A1

    公开(公告)日：2012-09-13

    申请号：US13478288

    申请日：2012-05-23

    申请人： Marinus Struik ,  Daniel R. Brown ,  Scott A. Vanstone ,  Robert P. Gallant ,  Adrian Antipa ,  Robert J. Lambert

    发明人： Marinus Struik ,  Daniel R. Brown ,  Scott A. Vanstone ,  Robert P. Gallant ,  Adrian Antipa ,  Robert J. Lambert

    IPC分类号： H04L9/08

    CPC分类号： H04L9/3066 ,  G06F7/725 ,  H04L9/30 ,  H04L9/3252

    摘要： Accelerated computation of combinations of group operations in a finite field is provided by arranging for at least one of the operands to have a relatively small bit length. In a elliptic curve group, verification that a value representative of a point R corresponds the sum of two other points uG and vG is obtained by deriving integers w,z of reduced bit length and so that v=w/z. The verification equality R=uG+vQ may then be computed as −zR+(uz mod n) G+wQ=O with z and w of reduced bit length. This is beneficial in digital signature verification where increased verification can be attained.

    摘要翻译： 通过将至少一个操作数布置成具有相对较小的比特长度来提供有限域中的组操作的组合的加速计算。 在椭圆曲线组中，代表点R的值对应于其他两个点uG和vG的和的验证是通过导出比特长度减小的整数w，z获得的，并且使得v = w / z。 然后，验证等式R = uG + vQ可以被计算为-zR +（uz mod n）G + wQ = 0，其中z和w为减少的比特长度。 这在数字签名验证中是有益的，其中可以实现增加的验证。

    Accelerated verification of digital signatures and public keys
    5.
    发明授权
    Accelerated verification of digital signatures and public keys 有权
    加快验证数字签名和公钥

    公开(公告)号：US08204232B2

    公开(公告)日：2012-06-19

    申请号：US11333296

    申请日：2006-01-18

    申请人： Marinus Struik ,  Daniel R. Brown ,  Scott A. Vanstone ,  Robert P. Gallant ,  Adrian Antipa ,  Robert J. Lambert

    发明人： Marinus Struik ,  Daniel R. Brown ,  Scott A. Vanstone ,  Robert P. Gallant ,  Adrian Antipa ,  Robert J. Lambert

    IPC分类号： H04L9/08

    CPC分类号： H04L9/3066 ,  G06F7/725 ,  H04L9/30 ,  H04L9/3252

    摘要： Accelerated computation of combinations of group operations in a finite field is provided by arranging for at least one of the operands to have a relatively small bit length. In a elliptic curve group, verification that a value representative of a point R corresponds the sum of two other points uG and vG is obtained by deriving integers w,z of reduced bit length and so that v=w/z. The verification equality R=uG+vQ may then be computed as −zR+(uz mod n) G+wQ=O with z and w of reduced bit length. This is beneficial in digital signature verification where increased verification can be attained.

    摘要翻译： 通过将至少一个操作数布置成具有相对较小的比特长度来提供有限域中的组操作的组合的加速计算。 在椭圆曲线组中，代表点R的值对应于其他两个点uG和vG的和的验证是通过导出比特长度减小的整数w，z获得的，并且使得v = w / z。 然后，验证等式R = uG + vQ可以被计算为-zR +（uz mod n）G + wQ = 0，其中z和w为减少的比特长度。 这在数字签名验证中是有益的，其中可以实现增加的验证。

    ACCELERATED VERIFICATION OF DIGITAL SIGNATURES AND PUBLIC KEYS
    6.
    发明申请
    ACCELERATED VERIFICATION OF DIGITAL SIGNATURES AND PUBLIC KEYS 有权
    数字签名和公钥的加速验证

    公开(公告)号：US20130064367A1

    公开(公告)日：2013-03-14

    申请号：US13620206

    申请日：2012-09-14

    申请人： Marinus Struik ,  Daniel R. Brown ,  Scott A. Vanstone ,  Robert P. Gallant ,  Adrian Antipa ,  Robert J. Lambert

    发明人： Marinus Struik ,  Daniel R. Brown ,  Scott A. Vanstone ,  Robert P. Gallant ,  Adrian Antipa ,  Robert J. Lambert

    IPC分类号： H04L9/00 ,  H04L9/28

    CPC分类号： H04L9/3066 ,  G06F7/725 ,  H04L9/30 ,  H04L9/3252

    摘要： Accelerated computation of combinations of group operations in a finite field is provided by arranging for at least one of the operands to have a relatively small bit length. In a elliptic curve group, verification that a value representative of a point R corresponds the sum of two other points uG and vG is obtained by deriving integers w,z of reduced bit length and so that v=w/z. The verification equality R=uG+vQ may then be computed as −zR+(uz mod n) G+wQ=O with z and w of reduced bit length. This is beneficial in digital signature verification where increased verification can be attained.

    摘要翻译： 通过将至少一个操作数布置成具有相对较小的比特长度来提供有限域中的组操作的组合的加速计算。 在椭圆曲线组中，代表点R的值对应于其他两个点uG和vG的和的验证是通过导出比特长度减小的整数w，z获得的，并且使得v = w / z。 然后，验证等式R = uG + vQ可以被计算为-zR +（uz mod n）G + wQ = 0，其中z和w为减少的比特长度。 这在数字签名验证中是有益的，其中可以实现增加的验证。

    Accelerated verification of digital signatures and public keys
    7.
    发明授权
    Accelerated verification of digital signatures and public keys 有权
    加快验证数字签名和公钥

    公开(公告)号：US08788827B2

    公开(公告)日：2014-07-22

    申请号：US13620206

    申请日：2012-09-14

    申请人： Marinus Struik ,  Daniel R. Brown ,  Scott A. Vanstone ,  Robert P. Gallant ,  Adrian Antipa ,  Robert J. Lambert

    发明人： Marinus Struik ,  Daniel R. Brown ,  Scott A. Vanstone ,  Robert P. Gallant ,  Adrian Antipa ,  Robert J. Lambert

    IPC分类号： H04L29/06 ,  H04L9/30

    CPC分类号： H04L9/3066 ,  G06F7/725 ,  H04L9/30 ,  H04L9/3252

    摘要： Accelerated computation of combinations of group operations in a finite field is provided by arranging for at least one of the operands to have a relatively small bit length. In a elliptic curve group, verification that a value representative of a point R corresponds the sum of two other points uG and vG is obtained by deriving integers w,z of reduced bit length and so that v=w/z. The verification equality R=uG+vQ may then be computed as −zR+(uz mod n) G+wQ=O with z and w of reduced bit length. This is beneficial in digital signature verification where increased verification can be attained.

    摘要翻译： 通过将至少一个操作数布置成具有相对较小的比特长度来提供有限域中的组操作的组合的加速计算。 在椭圆曲线组中，代表点R的值对应于其他两个点uG和vG的和的验证是通过导出比特长度减小的整数w，z获得的，并且使得v = w / z。 然后，验证等式R = uG + vQ可以被计算为-zR +（uz mod n）G + wQ = 0，其中z和w的比特长度减小。 这在数字签名验证中是有益的，其中可以实现增加的验证。