US 8,788,827 B2
ACCELERATED VERIFICATION OF DIGITAL SIGNATURES AND PUBLIC KEYS
Log In

General

US 8,788,827 B2
ACCELERATED VERIFICATION OF DIGITAL SIGNATURES AND PUBLIC KEYS
Tech Center:
2400 Networking, Multiplexing, Cable, and Security
Examiner:
Pramila Parthasarathy
Art Unit:
2497 Cryptography and Security
Inventors:
Marinus Struik; Daniel R. Brown; Scott A. Vanstone; Robert P. Gallant; Adrian Antipa; Robert J. Lambert
Priority:
01/18/06
Filed:
09/14/12
Granted:
07/22/14
Expiration:
01/18/25
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 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.
Cooperative Patent Classification (CPC)
G06G06F7/725G06FH04L9/3066H04L

Analytics

Cases

Patent Assignments

Citations