System and method for three-phase data encryption

• US 20060190728A1
• Filed: 02/24/2005
• Published: 08/24/2006
• Est. Priority Date: 02/24/2005
• Status: Active Grant

• Current Assignee: Access Business Group International LLC (Alticor Incorporated)
• Original Assignee: Access Business Group International LLC (Alticor Incorporated)
• Inventors: Baarman, David W., Leppien, Thomas Jay, Veiseh, Nima
• Granted Patent: US 7,725,715 B2
• Time in Patent Office: Days
• US Class Current: 713/168
• CPC Class Codes: G06Q 20/20 Point-of-sale [POS] network systems
• CPC Class Codes: H04L 9/302 involving the integer factorization problem, e.g. RSA or quadratic sieve [QS] schemes

Abstract

The present invention is directed to a three-phase encryption method and a three-phase decryption method, and an apparatus implementing the three-phase encryption method and/or the three-phase decryption method. To encrypt a message according to the three-phase encryption method, a content of a message is converted from a first form M to a second form M′; the content of the message is separated according to a spacing pattern; and the content of the message is scrambled according to a scrambling pattern. To decrypt the message encrypted using the three-phase encryption method, the scrambling and spacing patterns are reversed, and the content of the message is converted from the second form M′ to the first form M.

Claims

1. A method for encrypting a message comprising:

converting a content of the message from a first form M to a second form M′

as a function of a known encryption key E, a first secret prime number P, and a second secret prime number Q;

separating the content of the message according to a spacing pattern; and

scrambling the content of the message according to a scrambling pattern.

2. The method of claim 1, further comprising:

converting the content of the message from alphabetical syntax into numerical representation.

3. The method of claim 2, wherein the content of the message is converted from alphabetical syntax into numerical representation using a hash function.

4. The method of claim 1, wherein the known encryption key is relatively prime to the first secret prime number and the second secret prime number.

5. The method of claim 4, wherein the content of the message is converted from the first form M to a second form M′

according to the formula;

M′

=M^Emod(P*Q).

6. The method of claim 1, wherein the spacing pattern for separating the content of the message is a function of a third secret prime number R and a modulus K, according to the formula:

F(R)=R*mod(K).

7. The method of claim 6, wherein the phase of separating the content of the message according to a spacing pattern comprises:

pulsing the content of the message into a plurality of distinct packets.

8. The method of claim 6, wherein the phase of separating the content of the message according to a spacing pattern comprises:

inserting excess characters into the content of the message to distribute the content of the message into a plurality of groupings.

9. The method of claim 8 wherein the excess characters are spaces.

10. The method of claim 1 wherein the scrambling pattern is a function of a secrete modulus J and a fourth secret prime number S, according to the formula:

G(S)=S*mod(J).

11. The method of claim 1, further comprising:

after converting the content of the message, separating the content of the message, and scrambling the content of the message, sending an encrypted message to a receiving device.

12. The method of claim 11, further comprising:

receiving the encrypted message at the receiving device;

descrambling the content of the message;

placing the separated content of the message into a unified message; and

converting the content of the message from the second form M′

back into the first form M.

13. The method of claim 12, wherein the phase of descrambling the content of the message comprises:

calculating the scrambling pattern for the content of the message using a fourth secret prime number and a secret modulus; and

parsing through the encrypted message and reversing the scrambling pattern.

14. The method of claim 12, wherein the phase of placing the separated content of the message into a unified message comprises:

calculating a spacing pattern for the content of the message using a third secret prime number R and a second known encryption key K; and

parsing through the separated message to reverse the spacing pattern.

15. The method of claim 12, wherein the phase of converting the content of the message from the second form M′

back into the first form M comprises;

calculating a secret decryption key D as a function of the known encryption key E, first secret prime number P, and second secret prime number Q according to the formula;

D*E=1*mod((P−

1)*(Q−

1)); and

using the secret calculated decryption key D to convert the content of the message in the second form M′

back into the first form M according to the formula;

M=(M′

)^D*mod(P*Q).

16. An encryption and decryption method comprising:

converting a content of a message from a first form M to a second form M′

as a function of a known encryption key E, a first secret prime number P, and a second secret prime number Q;

separating the content of the message according to a spacing pattern, the spacing pattern a function of a third secret prime number R and a second known encryption key K;

scrambling the content of the message according to a scrambling pattern, the scrambling pattern a function of a fourth secret prime number S and a secret modulus J;

sending an encrypted message from an encrypting device to a receiving device

calculating the scrambling pattern and parsing through the encrypted message to reverse the scrambling pattern;

calculating the spacing pattern and parsing through the encrypted message to place the content of the message in a unified message; and

converting the content of the message from the second form M′

to the first form M as a function of a decryption key D, the first secret prime number P, and the second secret prime number Q.

17. The method of claim 16, wherein the product of the first secret prime number P and the second secret prime number Q is greater than the numerical value of the content of the message in the first form M.

18. The method of claim 17, wherein the known encryption key E is relatively prime to the first secret prime number P and the second secret prime number Q.

19. The method of claim 18, wherein the content of the message is converted from the first form M to the second form M′

according to the formula;

M′

=M^E*mod(P*Q).

20. The method of claim 16, wherein the spacing pattern is calculated according to the formula:

F(R)=R*mod(K).

21. The method of claim 16, wherein the scrambling pattern is calculated according to the formula:

G(S)=S*mod(J).

22. The method of claim 16, wherein the decryption key is calculated according to the formula:

D*E=1*mod((P−

1)*(Q−

1)).

23. The method of claim 22, wherein the content of the message is converted from the second form M′

to the first form M according to the formula;

M=(M′

)^D*mod(P*Q).

24. A system for encrypting a message, comprising:

an encryption module comprising a first processor, a first memory coupled with the first processor, and a first network interface coupled with a communications network, the first processor, and the first memory;

conversion logic stored in the first memory and executable by the first processor to convert a content of the message from a first form M to a second form M′

as a function of a known encryption key E, a first secret prime number P, and a secret prime number Q;

separating logic stored in the first memory and executable by the first processor to separate the content of the message according to a spacing pattern;

scrambling logic stored in the first memory and executable by the first processor to scramble the content of the message according to a scrambling pattern; and

communication logic stored in the first memory and executable by the first processor to send an encrypted message over the communications network.

25. The system of claim 24, wherein the content of the message is converted from the first form M to a second form M′

according to the formula;

M′

=M^Emod(P*Q).

26. The system of claim 24, wherein the spacing pattern for separating the content of the message is a function of a third secret prime number R and a modulus K, according to the formula:

F(R)=R*mod(K).

27. The system of claim 26, wherein the phase of separating the content of the message according to a spacing pattern comprises:

pulsing the content of the message into a plurality of distinct packets.

28. The system of claim 26, wherein the phase of separating the content of the message according to a spacing pattern comprises:

inserting excess characters into the content of the message to distribute the content of the message into a plurality of groupings.

29. The system of claim 24 wherein the scrambling pattern is a function of a secrete modulus J and a fourth secret prime number S, according to the formula:

G(S)=S*mod(J).

30. The system of claim 24, further comprising:

a decryption module comprising a second processor, a second memory coupled with the second processor, and a second network interface coupled with the communications network, the second processor, and the second memory;

a second communications logic stored in the second memory and executable by the second processor to receive the encrypted message over the communications network;

descrambling logic stored in the second memory and executable by the second processor to descramble the content of the message;

unifying logic stored in the second memory and executable by the second processor to place the separated content of the message into a unified message; and

second conversion logic stored in the second memory and executable by the second processor to convert the content of the message from the second form M′

back into the first form M.

31. The system of claim 30 wherein the second conversion logic calculates a secret decryption key D as a function of the known encryption key E, first secret prime number P, and second secret prime number Q according to the formula:

D*E=1*mod((P−

1)*(Q−

1)); and

using the secret calculated decryption key D, converts the content of the message in the second form M′

back into the first form M according to the formula;

M=(M′

)^D*mod(P*Q).

32. A system for encrypting and decrypting a message comprising:

conversion means for converting a content of the message from a first form M to a second form M′

as a function of a known encryption key E, a first secret prime number P, and a second secret prime number Q;

separating means for separating the content of the message according to a spacing pattern, the spacing pattern a function of a third secret prime number R and a second known encryption key K;

scrambling means for scrambling the content of the message according to a scrambling pattern, the scrambling pattern a function of a fourth secret prime number S and a secret modulus J;

descrambling means for calculating the scrambling pattern and parsing through the encrypted message to reverse the scrambling pattern;

unifying means for calculating the spacing pattern and parsing through the encrypted message to place the content of the message into a unified message; and

second conversion means for converting the content of the message from the second form M′

to the first form M as a function of a decryption key D, the first secret prime number P, and the second secret prime number Q.