Verifiable generation of weak symmetric keys for strong algorithms

• US 20080037775A1
• Filed: 03/31/2006
• Published: 02/14/2008
• Est. Priority Date: 03/31/2006
• Status: Abandoned Application

• Current Assignee: Avaya Incorporated
• Original Assignee: Avaya Technology LLC (Avaya Incorporated)
• Inventors: Gilman, Robert R.
• Application Number:
  US11/395,877
• Publication Number:
  US 20080037775A1
• Time in Patent Office: Days
• US Class Current: 380/44
• CPC Class Codes: H04L 9/088 Usage controlling of secret information, e.g. techniques for restricting cryptographic keys to pre-authorized uses, different access levels, validity of crypto-period, different key- or password length, or different strong and weak cryptographic algorithms network architectures or network communication protocols for using time-dependent keys in a packet data network H04L63/068

Abstract

The present invention provides a method, system, and device for producing cryptographic keys. More specifically, the cryptographic keys may be produced such that they have an effective key size and an apparent key size that differs from the effective key size. Generally, the effective key size is not restricted by export regulations and the apparent key size may be restricted by export regulations.

Claims

1. A method for producing a cryptographic key, comprising:

a communication device generating a first key having a first apparent size and a first effective size that is less than a predetermined key size;

determining a fixed key;

choosing a fixed cryptographic algorithm;

using the fixed key and the chosen algorithm to project the first key onto a second larger key space to create a second key, wherein the second key has a second apparent size that is larger than the predetermined key size and the first effective size that is less than the predetermined key size; and

distributing the second key to at least one recipient communication device.

3. The method of claim 1, wherein the projection of the first key comprises employing at least one of an asymmetric encryption algorithm and a cryptographic hash algorithm that utilizes the fixed key.

4. The method of claim 1, wherein the projection of the first key comprises employing a symmetric encryption algorithm that utilizes the fixed key.

5. The method of claim 1, wherein the at least one recipient communication device comprises an authorized third party communication device, the method further comprising:

distributing the fixed key to the authorized third party communication device; and

sending the second key to the authorized third party communication device;

the authorized third party communication device using the fixed key to verify the first effective size of the second key.

6. The method of claim 1, wherein the projecting step comprises combining the first key with M-bits of zeros and/or ones to create a concatenated key, wherein M is greater than or equal to one, and wherein the M-bits of zeros and/or ones are at least one of placed in front of the first key, behind the first key, and interspersed within the first key.

7. The method of claim 1, further comprising:

determining a maximum effective size of a generated key;

receiving the second key;

analyzing the second key to determine the effective size of the second key and the apparent size of the second key; and

determining that the effective size of the second key is not greater than the determined maximum effective size of the generated key.

8. The method of claim 1, wherein the first effective size is 64-bits, the first apparent size is 64-bits, and wherein the second apparent size is greater than 64-bits.

9. The method of claim 1, wherein the first effective size is not greater than an allowable key generation size according to export regulations, and wherein the second apparent size is greater than the allowable key generation size according to export regulations.

10. A computer readable medium comprising executable instructions operable to perform the method of claim 1.

28. The method of claim 1, wherein the cryptographic algorithm used to project the first key onto the second key space comprises a reversible algorithm.

30. The method of claim 6, further comprising using the fixed key to scramble the concatenated key comprising the additional M-bits thereby creating the second key.

2. (canceled)

11. A device for producing a cryptographic key, comprising:

a computer readable medium comprising processor executable instructions, the instructions comprising;

a key generator operable to produce at least a first key having a first apparent size and a first effective size;

a key expansion member operable to expand the first key in order to form a second key by concatenating the first key with M-bits of zeros and/or ones in order to form the second key, wherein M is greater than or equal to one, and wherein the M-bits of zeros and/or ones are distributed within the first key according to a predetermined pattern, wherein the second key has a second apparent size and the first effective; and

a key encryptor operable to utilize a fixed key and a cryptographic algorithm to scramble the second key.

13. The device of claim 11, further comprising an interface operable to transmit the second key to at least one recipient.

14. The device of claim 11, wherein the encryption algorithm comprises at least one of an asymmetric encryption algorithm and a hash encryption algorithm.

15. The device of claim 11, wherein the encryption algorithm comprises a symmetric encryption algorithm.

16. The device of claim 13, wherein the at least one recipient comprises an authorized third party, wherein the fixed key is provided to the authorized third party, and wherein the projected second key is sent to the authorized third party via the interface such that the first effective size of the second key can be determined by the authorized third party using the fixed key.

17. The device of claim 11, wherein the predetermined pattern comprises at least one of placing the M-bits of zeros and/or ones in front of the first key, behind the first key, and interspersing them within the first key.

18. The device of claim 11, wherein the first effective size is 64-bits, the first apparent size is 64-bits, and wherein the second apparent size is greater than 64-bits.

19. The device of claim 11, wherein the first effective size is not greater than an allowable key generation size according to export regulations, and wherein the second apparent size is greater than the allowable key generation size according to export regulations.

29. The method of claim 11, wherein the scrambling of the second key is reversible using the fixed key.

12. (canceled)

20. A method for producing a cryptographic key, comprising:

a communication device generating a first key having a first key strength and a first apparent size;

expanding the first key to create a second key, wherein the second key has a second key strength and a second apparent size, the second key strength being at least the first key strength but less than the key strength based on the second apparent size of the second key, and wherein the second apparent size is larger than the first apparent size;

determining a fixed key;

scrambling the second key using the fixed key; and

distributing the second key to at least one recipient communication device.

22. The method of claim 20, wherein the scrambling the second key comprises employing an asymmetric encryption algorithm and a hash encryption algorithm that utilizes the fixed key.

23. The method of claim 20, wherein the scrambling the second key comprises employing a symmetric encryption algorithm that utilizes the fixed key.

24. The method of claim 20, wherein the at least one recipient communication device comprises an authorized third party communication device, the method further comprising:

distributing the fixed key to the authorized third party communication device; and

sending the second key to the authorized third party communication device;

the authorized third party communication device using the fixed key to reverse the scrambling of the second key such that the second key strength can be determined by the authorized third party.

25. The method of claim 20, wherein the expanding step comprises concatenating the first key with M-bits of zeros and/or ones, wherein M is greater than or equal to one, and wherein the M-bits of zeros and/or ones are at least one of placed in front of the first key, behind the first key, and distributed within the first key.

26. The method of claim 20, further comprising:

determining a maximum key strength of a generated key;

receiving the second key;

analyzing the second key to determine the second key strength and the second apparent size; and

determining that the second key strength is not greater than the determined maximum key strength of the generated key.

27. The method of claim 20, wherein the second key strength is not greater than an allowable key generation size according to export regulations, and wherein the second apparent size is greater than the allowable key generation size according to export regulations.

21. (canceled)