IP Library Granted Patent US 8,953,787
Granted Patent B2
US 8,953,787 · App. 13/527,891 · Granted Feb 10, 2015

Strengthened public key protocol

Inventors: Scott A. Vanstone (Campbellvile, CA); Alfred John Menezes (Waterloo, CA); Minghua Qu (Mississauga, CA); Donald B. Johnson (Manassas, VA)
Assignee: Certicom Corp.
H04L9/0841H04L9/3066H04L9/3252G06F7/725
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,953,787
App. No.
13/527,891
Granted
Feb 10, 2015
Kind
B2
Abstract

A method of determining the integrity of a message exchanged between a pair of correspondents. The message is secured by embodying the message in a function of a public key derived from a private key selected by one of the correspondents. The method comprises first obtaining the public key. The public key is then subjected to at least one mathematical test to determine whether the public key satisfies predefined mathematical characteristics. Messages utilizing the public key are accepted if the public key satisfies the predefined mathematical characteristics.

Claims (24)

1. A method performed by a computing device in a communication system, the method comprising:

obtaining a public key;

testing, by a computing device, whether said public key is equal to an identity element of a prime-order subgroup associated with said communication system;

rejecting said public key if said public key equals said identity element; and

performing a cryptographic operation associated with the public key, the cryptographic operation comprising at least one of: a verification of a signature using the public key; a key agreement scheme; enciphering a symmetric key with the public key; and a certification of the public key.

2. The method of claim 1 , wherein obtaining the public key comprises receiving the public key.

3. The method of claim 1 , wherein the subgroup is a subgroup of a group, and the order of the group is a prime number.

4. The method of claim 1 , wherein said subgroup comprises points on an elliptic curve defined over a finite field, the number of said points being a prime number, and said testing comprises testing whether the public key is a point on said elliptic curve.

5. The method of claim 4 , wherein testing whether the public key is a point on said elliptic curve comprises a substitution of the public key into an equation defining the elliptic curve.

6. The method of claim 1 , wherein said subgroup comprises points on an elliptic curve defined over a finite field, and the method further comprises testing whether the public key is a point on said elliptic curve.

7. The method of claim 6 , wherein testing whether the public key is a point on said elliptic curve comprises a substitution of the public key into an equation defining the elliptic curve.

8. A non-transitory computer-readable medium comprising instructions that are operable when executed by one or more processors to perform operations for validation of a public key, the public key for use in a communication system, the operations comprising:

obtaining the public key;

testing whether said public key is equal to an identity element of a prime-order subgroup associated with said communication system;

rejecting said public key if said public key equals said identity element; and

performing a cryptographic operation associated with the public key, the cryptographic operation comprising at least one of: a verification of a signature using the public key; a key agreement scheme; enciphering a symmetric key with the public key; and a certification of the public key.

9. The computer-readable medium of claim 8 , wherein said subgroup comprises points on an elliptic curve defined over a finite field, the number of said points being a prime number, and said testing comprises testing whether the public key is a point on said elliptic curve.

10. A computing device operable to perform validation of a public key, the public key for use in a communication system, the computing device comprising:

one or more processor devices configured to:

obtain the public key;

test whether said public key is equal to an identity element of a prime-order subgroup associated with said communication system;

rejecting said public key if said public key equals said identity element; and

performing a cryptographic operation associated with the public key, the cryptographic operation comprising at least one of: a verification of a signature using the public key; a key agreement scheme; enciphering a symmetric key with the public key; and a certification of the public key.

11. The computing device of claim 10 , wherein to test, the one or more processor devices are configured to compare said public key to said identity element of said subgroup and confirm that there is no match.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 16, 2023
From: BLACKBERRY LIMITED
To: MALIKIE INNOVATIONS LIMITED
Reel/Frame 064104/0103 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 24, 2012
From: JOHNSON, DONALD B.; VANSTONE, SCOTT A.; MENEZES, ALFRED JOHN; QU, MINGHUA
To: CERTICOM CORP.
Reel/Frame 028624/0381 →
Continuity (7)
Continuation 12458468 · Jul 13, 2009
Continuation 10185735 · Jul 1, 2002
Continuation In Part 09283658 · Apr 1, 1999
Continuation In Part 09840096 · Apr 24, 2001
Continuation 08649308 · May 17, 1996
Continuation 08949781 · Oct 14, 1997
Related Publication 20120257758A1 · Oct 11, 2012