Method and system for securing communication

• US 8,782,408 B2
• Filed: 03/25/2010
• Issued: 07/15/2014
• Est. Priority Date: 03/25/2009
• Status: Active Grant

• Current Assignee: PACid Technologies, LLC
• Original Assignee: PACid Technologies, LLC
• Inventors: Fielder, Guy
• Primary Examiner(s): SHAW, BRIAN F
• Application Number:
  US13/203,377
• Publication Number:
  US 20110314281A1
• Time in Patent Office: 1,573 Days
• Field of Search: 713/168, 713/171, 370/338
• US Class Current: 713/168
• CPC Class Codes: H04L 2209/24 Key scheduling, i.e. generating round keys or sub-keys for block encryption
• CPC Class Codes: H04L 63/0428 wherein the data content is protected, e.g. by encrypting or encapsulating the payload
• CPC Class Codes: H04L 63/065 for group communications cryptographic mechanisms or cryptographic arrangements for key management involving conference or group key H04L9/0833
• CPC Class Codes: H04L 63/083 using passwords cryptographic mechanisms or cryptographic arrangements for entity authentication using a predetermined code H04L9/3226
• CPC Class Codes: H04L 9/0838 Key agreement, i.e. key establishment technique in which a shared key is derived by parties as a function of information contributed by, or associated with, each of these network architectures or network communication protocols for key exchange in a packet data network H04L63/061
• CPC Class Codes: H04L 9/16 the keys or algorithms being changed during operation

Abstract

A method for securing communication among members of a group. The method includes a first member obtaining a first secret. An n-bit generator executing on the first member generates a first message digest using the first secret. The first member extracts a first encryption solution and a second encryption solution, at least in part, from the first message digest, encrypts a first communication using the first encryption solution to obtain a first encrypted communication, and sends, to a second member of the group, the first encrypted communication. The first member further receives, from the second member, a second encrypted communication, and decrypts the second encrypted communication using the second encryption solution to obtain a second communication.

Claims

1. A method for securing communication among a plurality of members, comprising:

obtaining, by a first member of a group, a first secret;

generating, by an n-bit generator executing on the first member, a first message digest using the first secret;

extracting, by the first member, a first encryption solution and a second encryption solution, at least in part, from the first message digest, wherein the first encryption solution comprises a first encryption key and first algorithm selector bits, and wherein the second encryption solution comprises a second encryption key and second algorithm selector bits;

selecting, by the first member and from a plurality of encryption algorithms, a first encryption algorithm corresponding to the first algorithm selector bits;

encrypting, by the first member, a first communication using the first encryption key and the first encryption algorithm to obtain a first encrypted communication;

sending, by the first member to a second member of the group, the first encrypted communication;

receiving, by the first member from the second member, a second encrypted communication;

selecting, by the first member and from the plurality of encryption algorithms, a second encryption algorithm corresponding to the second algorithm selector bits;

decrypting, by the first member, the second encrypted communication using the second encryption solution to obtain a second communication;

generating, by the n-bit generator, a second message digest using the first secret, a second secret, and a first change value;

extracting, by the first member, a third encryption solution and a fourth encryption solution, at least in part, from the second message digest;

encrypting, by the first member, a third communication using the third encryption solution to obtain a third encrypted communication;

sending, by the first member to the second member, the third encrypted communication;

receiving, by the first member from the second member, a fourth encrypted communication; and

decrypting, by the first member, the fourth encrypted communication using the fourth encryption solution to obtain a fourth communication.

2. The method of claim 1, wherein decrypting the second encrypted communication comprises:

decrypting the second encrypted communication using the second encryption algorithm and the second encryption key.

3. The method of claim 2, wherein the first encryption algorithm and the second encryption algorithm are different encryption algorithms.

4. The method of claim 1, wherein generating the first message digest comprises using a third secret.

5. The method of claim 1, further comprising:

generating, by the n-bit generator, a third message digest using the first secret, a third secret, and a second change value.

6. The method of claim 1, wherein the first encrypted communication and the third encrypted communication are sent during a single communication session.

7. The method of claim 1, wherein generating the second message digest comprises:

combining the first change value with an intermediate result to create an interim dynamic secret, wherein the intermediate result is obtained during the generation of the first message digest; and

using the interim dynamic secret to generate the second message digest.

8. A computing device for securing communication among a plurality of members comprising:

a processor;

a memory; and

software instructions stored in memory for causing the computing device to;

obtain, by a first member of a group, a first secret, wherein the first member is the computing device;

generate, by an n-bit generator executing on the first member, a first message digest using the first secret;

extract a first encryption solution and a second encryption solution, at least in part, from the first message digest, wherein the first encryption solution comprises a first encryption key and first algorithm selector bits, and wherein the second encryption solution comprises a second encryption key and second algorithm selector bits;

select, by the first member and from a plurality of encryption algorithms, a first encryption algorithm corresponding to the first algorithm selector bits;

encrypt a first communication using the first encryption key and the first encryption algorithm to obtain a first encrypted communication;

send, to a second member of the group, the first encrypted communication;

receive, from the second member, a second encrypted communication;

select, by the first member and from the plurality of encryption algorithms, a second encryption algorithm corresponding to the second algorithm selector bits;

decrypt the second encrypted communication using the second encryption solution to obtain a second communication;

generate, by the n-bit generator, a second message digest using the first secret, a second secret, and a first change value;

extract a third encryption solution and a fourth encryption solution, at least in part, from the second message digest;

encrypt a third communication using the third encryption solution to obtain a third encrypted communication;

send, to the second member, the third encrypted communication;

receive, from the second member, a fourth encrypted communication; and

decrypt the fourth encrypted communication using the fourth encryption solution to obtain a fourth communication.

9. The computing device of claim 8, wherein decrypting the second encrypted communication comprises:

decrypting the second communication using the second encryption algorithm and the second encryption key.

10. The computing device of claim 9, wherein the first encryption algorithm and the second encryption algorithm are different encryption algorithms.

11. The computing device of claim 8, wherein generating the first message digest comprises using a third secret.

12. The computing device of claim 8, wherein the software instructions further cause the computing device to:

generate, by the n-bit generator, a third message digest using the first secret, a third secret, and a second change value,

wherein the first encryption solution and the second encryption solution are extracted, at least in part, from the third message digest.

13. The computing device of claim 8, wherein the first encrypted communication and the third encrypted communication are sent during a single communication session.

14. The computing device of claim 8, wherein generating the second message digest comprises:

combining the first change value with an intermediate result to create an interim dynamic secret, wherein the intermediate result is obtained during the generation of the first message digest; and

using the interim dynamic secret to generate the second message digest.

15. A non-transitory computer readable medium comprising computer readable program code embodied therein for causing a computer system to perform a method for securing communication among a plurality of members, the method comprising:

obtaining, by a first member of a group, a first secret;

generating, by an n-bit generator executing on the first member, a first message digest using the first secret;

extracting, by the first member, a first encryption solution and a second encryption solution, at least in part, from the first message digest, wherein the first encryption solution comprises a first encryption key and first algorithm selector bits, and wherein the second encryption solution comprises a second encryption key and second algorithm selector bits;

selecting, by the first member and from a plurality of encryption algorithms, a first encryption algorithm corresponding to the first algorithm selector bits;

encrypting, by the first member, a first communication using the first encryption key and the first encryption algorithm to obtain a first encrypted communication;

sending, by the first member to a second member of the group, the first encrypted communication;

receiving, by the first member from the second member, a second encrypted communication;

selecting, by the first member and from the plurality of encryption algorithms, a second encryption algorithm corresponding to the second algorithm selector bits;

decrypting, by the first member, the second encrypted communication using the second encryption solution to obtain a second communication;

generating, by the n-bit generator, a second message digest using the first secret, a second secret, and a first change value;

extracting, by the first member, a third encryption solution and a fourth encryption solution, at least in part, from the second message digest;

encrypting, by the first member, a third communication using the third encryption solution to obtain a third encrypted communication;

sending, by the first member to the second member, the third encrypted communication;

receiving, by the first member from the second member, a fourth encrypted communication; and

decrypting, by the first member, the fourth encrypted communication using the fourth encryption solution to obtain a fourth communication.

16. The non-transitory computer readable medium of claim 15, wherein decrypting the second encrypted communication comprises:

decrypting the second communication using the second encryption algorithm and the second encryption key.

17. The non-transitory computer readable medium of claim 16, wherein the first encryption algorithm and the second encryption algorithm are different encryption algorithms.

18. The non-transitory computer readable medium of claim 15, wherein generating the first message digest comprises using a third secret.

19. The non-transitory computer readable medium of claim 15, wherein the method further comprises:

generating, by the n-bit generator, a third message digest using the first secret, a third secret, and a second change value.

20. The non-transitory computer readable medium of claim 15, wherein the first encrypted communication and the third encrypted communication are sent during a single communication session.

21. The non-transitory computer readable medium of claim 15, wherein generating the second message digest comprises:

combining the first change value with an intermediate result to create an interim dynamic secret, wherein the intermediate result is obtained during the generation of the first message digest; and

using the interim dynamic secret to generate the second message digest.