IP Library Granted Patent US 8,705,730
Granted Patent B2
US 8,705,730 · App. 12/978,488 · Granted Apr 22, 2014

Elliptic curve cryptography with fragmented key processing and methods for use therewith

Inventors: Zeev Lieber (North York, CA); Thomas Jefferson Saremi (Mississauga, CA)
Assignee: Morega Systems Inc.
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,705,730
App. No.
12/978,488
Filed
Dec 24, 2010
Granted
Apr 22, 2014
Kind
B2
Art Unit
2494
USPC
380/28
Abstract

A cryptography module includes a key store having a plurality of storage locations for storing a private key as k key fragments. One or more crypto-processing segments each operate based on corresponding ones of the k key fragments to process a message in accordance with elliptic curve digital signature algorithm (ECDSA) to produce a signed message.

Claims (28)

1. A cryptography module comprising:

a key store having a plurality of storage locations for storing a private key as k key fragments that include k−1 key segments and a remainder key fragment, where k is greater than 2, wherein the k−1 key segments are generated as random key segments, and wherein the remainder key fragment is generated based on the k−1 key segments; and

at least one crypto-processing segment, coupled to the key store, operating based on the k key fragments for processing a message in accordance with elliptic curve digital signature algorithm (ECDSA) to produce a signed message.

2. The cryptography module of claim 1 wherein the at least one crypto-processing segment generates a modular product based on corresponding ones of the k key fragments.

3. The cryptography module of claim 1 wherein the at least one crypto-processing segment sequentially processes the message based on the k key fragments to produce the signed message.

4. The cryptography module of claim 1 wherein the at least one crypto-processing segments includes a plurality of crypto-processing segments that operate in parallel to process the message into a plurality of fragmented key results and wherein the cryptography module further comprises:

a combiner, coupled to the plurality of crypto-processing segments, that combines the plurality of fragmented key results to produce the signed message.

5. The cryptography module of claim 4 wherein the combiner generates a sum of the plurality of fragmented key results.

6. The cryptography module of claim 1 wherein:

d =( m 1 +m 2 +m 3 + . . . +m k )modulo n

where m i represents the ith of the k key fragments, d represents the key and n is an integer.

7. A method comprising:

storing a private key in k key fragments that include k−1 key segments and a remainder key fragment, where k is greater than 2, wherein the k−1 key segments are generated as random key segments, and wherein the remainder key fragment is generated based on the k−1 key segments; and

processing a message in accordance with elliptic curve digital signature algorithm (ECDSA) via at least one crypto-processing segment, based on the k key fragments, to produce a signed message.

8. The method of claim 7 wherein the at least one crypto-processing segment generates a modular product based on corresponding ones of the k key fragments.

9. The method of claim 7 wherein processing the message includes sequentially processing the message to produce the signed message.

10. The method of claim 7 wherein processing the message includes:

processing the message in parallel to generate a plurality of fragmented key results; and

combining the plurality of fragmented key results to produce the signed message.

11. The method of claim 7 wherein combining the plurality of fragmented key results includes generating a sum of the plurality of fragmented key results.

12. The method of claim 7 wherein:

d =( m 1 +m 2 +m 3 + . . . +m k )modulo n

where m i represents the ith of the k key fragments, d represents the key and n is an integer.

13. A method comprising:

generating at least one random number via a random number generator;

generating k−1 key fragments via a device based on the at least one random number, where k is greater than 2; and

generating a remainder key fragment via the device, based on a modulo remainder computed from the k−1 key fragments and a key;

wherein the key includes a private key of a elliptic curve digital signature algorithm (ECDSA).

Assignments (6)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 28, 2019
From: 3311148 NOVA SCOTIA LIMITED
To: AT&T INTELLECTUAL PROPERTY I, L.P.
Reel/Frame 048155/0358 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 24, 2019
From: MOREGA SYSTEMS INC.
To: 3311148 NOVA SCOTIA LIMITED
Reel/Frame 048126/0238 →
RELEASE OF SECURITY INTEREST Recorded May 18, 2016
From: COMERICA BANK
To: MOREGA SYSTEMS INC.
Reel/Frame 038635/0793 →
SECURITY AGREEMENT Recorded Apr 17, 2013
From: MOREGA SYSTEMS INC.
To: COMERICA BANK, A TEXAS BANKING ASSOCIATION AND AUTHORIZED FOREIGN BANK UNDER THE BANK ACT (CANADA)
Reel/Frame 030237/0835 →
SECURITY AGREEMENT Recorded Oct 15, 2012
From: MOREGA SYSTEMS INC.
To: COMERICA BANK, A TEXAS BANKING ASSOCIATION AND AUTHORIZED FOREIGN BANK UNDER THE BANK ACT (CANADA)
Reel/Frame 029125/0670 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 16, 2011
From: LIEBER, ZEEV; SAREMI, THOMAS JEFFERSON
To: MOREGA SYSTEMS INC.
Reel/Frame 026139/0161 →
Continuity (2)
Provisional Application 61426794 · Dec 23, 2010
Related Publication 20120163581A1 · Jun 28, 2012