Selecting cached RSA keys in response to RSA key requests

• US 20040156506A1
• Filed: 02/10/2003
• Published: 08/12/2004
• Est. Priority Date: 02/10/2003
• Status: Active Grant

• Current Assignee: Micro Focus LLC (Open Text Corporation)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Sanchez, Mauricio
• Granted Patent: US 7,483,537 B2
• Time in Patent Office: Days
• US Class Current: 380/277
• CPC Class Codes: H04L 9/0891 Revocation or update of secret information, e.g. encryption key update or rekeying
• CPC Class Codes: H04L 9/14 using a plurality of keys or algorithms
• CPC Class Codes: H04L 9/302 involving the integer factorization problem, e.g. RSA or quadratic sieve [QS] schemes

Abstract

A method of responding to a request for a key of a first length is provided. According to the method, the request for the key of the first length is received. Moreover, it is determined whether any one of a plurality of cached keys satisfies the request. If any one of the plurality of cached keys satisfies the request, a cached key of the first length is selected. Also, the selected cached key is removed from the plurality of cached keys. Thus, in response to the request, the selected cached key of the first length is provided.

Claims

1. A method of responding to a request for a key of a first length, said method comprising:

receiving said request for said key of said first length;

determining whether any one of a plurality of cached keys satisfies said request;

if any one of said plurality of cached keys satisfies said request, selecting a cached key of said first length and removing said selected cached key from said plurality of cached keys; and

in response to said request, providing said selected cached key of said first length.

2. The method as recited in claim 1 further comprising:

sending a message to a key generator to generate at a future time a replacement key of said first length to replace said selected cached key to respond to a future request for a second key of said first length.

3. The method as recited in claim 2 wherein said key generator generates said replacement key in a self-check time slice manner.

4. The method as recited in claim 1 further comprising:

if none of said plurality of cached keys satisfies said request, requesting a key generator to generate said key of said first length in real-time;

incrementing a value representing a total number of cached keys of said first length to include in said plurality of cached keys; and

providing said key of said first length generated in real-time.

5. The method as recited in claim 1 wherein each cached key is one of a plurality of lengths.

6. The method as recited in claim 1 wherein said first length is one of 512 bits, 768 bits, and 1024 bits.

7. The method as recited in claim 1 wherein said key is a RSA key.

8. A method of managing a plurality of cached keys, said method comprising:

determining whether to generate an additional key for said plurality of cached keys;

if it is determined to generate said additional key, acquiring control of a central processing unit and recording a first current time;

while a difference between a second current time and said first current time is not greater than a predefined time slice, executing on said central processing unit one or more operational units of a plurality of operational units for generating said additional key; and

if said additional key is completed, saving said additional key as a cached key with said plurality of cached keys.

9. The method as recited in claim 8 further comprising:

if said difference between said second current time and said first current time is greater than said predefined time slice, relinquishing control of said central processing unit;

receiving control again of said central processing unit;

recording a new first time; and

while a difference between a new second current time and said new first current time is not greater than said predefined time slice, executing on said central processing unit one or more operational units of said plurality of operational units for generating said additional key.

10. The method as recited in claim 8 wherein said predefined time slice is adjustable.

11. The method as recited in claim 8 wherein each cached key is one of a plurality of lengths.

12. The method as recited in claim 11 wherein said plurality of lengths includes a first length, wherein said first length is one of 512 bits, 768 bits, and 1024 bits.

13. The method as recited in claim 8 wherein each cached key is a RSA key.

14. A system comprising:

a storage unit for storing a plurality of cached keys and for responding to a request for a key of a first length;

a central processing unit (CPU); and

a key generator for interacting with said CPU to generate at a future time an additional key for said plurality of cached keys to respond to a future request for a second key of said first length.

15. The system as recited in claim 14 wherein said key generator interacts with said CPU to generate said additional key in a self-check time slice manner.

16. The system as recited in claim 14 wherein said storage unit determines whether any one of said plurality of cached keys satisfies said request, and wherein if any one of said plurality of cached keys satisfies said request, said storage unit selects a cached key of said first length, removes said selected cached key from said plurality of cached keys, and provides said selected cached key of said first length.

17. The system as recited in claim 14 wherein each cached key is one of a plurality of lengths.

18. The system as recited in claim 14 wherein said first length is one of 512 bits, 768 bits, and 1024 bits.

19. The system as recited in claim 14 wherein said key is a RSA key.

20. The system as recited in claim 14 wherein said storage unit sends a message to said key generator to generate at said future time said additional key of said first length to respond to said future request for said second key of said first length.