Managing a plurality of cached keys

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

determining that an additional key is to be generated for a plurality of cached keys when a number of cached keys is below a predetermined value;

acquiring control of a central processing unit and recording a first current time;

starting generation of the additional key through control of the central processing unit;

determining whether the additional key is complete;

upon determining that the additional key is complete, saving the additional key as a cached key with the plurality of cached keys;

upon determining that the additional key is not complete:

calculating a difference between a second current time and said first current time;

while the difference is not greater than a predefined time slice, continuing to generate the additional key; and

when the difference between the second current time and the first current time is greater than the predefined time slice, relinquishing control of the central processing unit to cease generation of the additional key.

2. The method as recited in claim 1 wherein said predefined time slice is adjustable.

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

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

5. The method as recited in claim 1 wherein each cached key is a RSA key.

6. The method as recited in claim 1 , further comprising checking whether a number of cached keys in the plurality of cached keys is below a predetermined value in determining that the additional key is to be generated.

7. The method as recited in claim 1 , wherein the plurality of cached keys comprises groups of keys, said method further comprising checking whether a number of cached keys in each of the groups of keys is below a predetermined value associated with each group of keys in determining that the additional key is to be generated.

8. The method as recited in claim 1 , further comprising:

receiving control again of said central processing unit following relinquishing of control;

recording a new first current 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, continuing generation of said additional key through control of the central processing unit.

9. A non-transitory computer readable storage medium on which is embedded a computer program, said computer program that when executed by a processor, implementing a method for managing a plurality of keys, said computer program comprising computer readable code to:

determine that an additional key is to be generated for a plurality of cached keys when a number of cached keys is below a predetermined value;

acquire control of a central processing unit and recording a first current time;

start generation of the additional key through control of the central processing unit;

determine whether the additional key is complete;

upon a determination that the additional key is complete, save the additional key as a cached key with the plurality of cached keys;

upon a determination that the additional key is not complete:

calculate a difference between a second current time and said first current time;

while the difference is not greater than a predefined time slice, continue to generate said additional key; and

when the difference between the second current time and the first current time is greater than the predefined time slice, relinquishing control of the central processing unit to cease generation of the additional key.

10. The non-transitory computer readable storage medium of claim 9 , said computer program comprising computer readable code to:

when said difference between said second current time and said first current time is greater than said predefined time slice, relinquish control of said central processing unit to cease generation of the additional key.

11. The non-transitory computer readable storage medium of claim 10 , said computer program comprising computer readable code to:

receive control again of said central processing unit;

record a new first current 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, continue generation of said additional key through control of the central processing unit.