ACCELERATED VERIFICATION OF DIGITAL SIGNATURES AND PUBLIC KEYS

摘要

Accelerated computation of combinations of group operations in a finite fieldis provided by arranging for at least one of the operands to have a relativelysmall bit length. In a elliptic curve group, verification that a valuerepresentative of a point R corresponds the sum of two other points uG and vGis 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 +(uzmod n) G + wQ = O with z and w of reduced bit length. This is beneficial indigital signature verification where increased verification can be attained.