Granted Patent B2

US 7,483,537 · App. 10/364,219 · Granted Jan 27, 2009

Abstract

Claims (17)

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

storing a plurality of cached keys, wherein each cached key is one of a plurality of lengths;

storing a plurality of threshold values, each associated with a respective length of said lengths, wherein each threshold value represents a maximum number of said cached keys of said respective length to store;

receiving said request for said key of said first length;

determining whether any one of said cached keys satisfies said request by identifying any one of said plurality of cached keys if any one of said cached keys is one of said first length;

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

adjusting said threshold values based on consumption of said cached keys; and

in response to said request, providing access to 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.

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 threshold value for said first length; and

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

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

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

Assignments (11)