公开(公告)号：US20140344579A1

公开(公告)日：2014-11-20

申请号：US14318313

申请日：2014-06-27

Applicant: Certicom Corp.

Inventor： Marinus STRUIK ,  Daniel Richard L. BROWN ,  Scott Alexander VANSTONE ,  Robert Philip GALLANT ,  Adrian ANTIPA ,  Robert John LAMBERT

IPC: H04L9/30 ,  H04L9/32

CPC classification number: H04L9/3066 ,  G06F7/725 ,  H04L9/30 ,  H04L9/3252

Abstract: 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 that v=w/z. The verification equality R=uG+vQ may then be computed as −zR+(uz mod n)+wQ=O with z and w of reduced bit length This is beneficial in digital signature verification where increased verification can be attained.

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