Patent EA-003231-B1 (EA)
Title: Cryptographic communication process and apparatus
Inventor: SCHEIDT EDWARD M
IPC: G09C1/00
Filed: 1998-07-02
Abstract: 1. A communication system, comprising: a) an origination space; b) a communications channel; and c) a destination space associated with the origination space via the communications channel; d) wherein the origination space includes: 1) an encryption engine for generating an output symbol Ot based on an input symbol It; and 2) means for receiving an encrypt key, an encrypt text/key relation, and the input symbol; e) wherein the destination space includes: 1) a decryption engine for generating a decrypted symbol I't based on the output symbol received from the origination space via the communications channel; and 2) means for receiving a decrypt key and a decrypt text/key relation; f) wherein the encrypt text/key relation controls the encryption engine such that Ot = alphaN(t) + piN[alphaN-1(t)+piN-1[alphaH-2(t) + ...+pi2[alpha1(t) +pi1 [It+ alpha0(t)]] ...]], mod W, where alphaN, alphaN-1, ... , alpha1, alpha0 are N+1 additive transformations defined by the encrypt key, where piN, piN-1, ..., pi2, pi0 are N permutations defined by the encrypt key, and where W represents the number of possibilities for each permutation defined by the encrypt key; and g) wherein the decrypt text/key relation controls the decryption engine such that I't =pi1<-1>[pi2<-1>[pi3<-1> ... [piN-1<-1>[piN-1[Ot-alpha'N(t)]-alpha'N-1(t)]-, <1> .... - alpha'3(t)]- alpha'2(t)]-alpha'1(t)]-alpha'0(t), mod W, where pi1<-1> is defined by the decrypt key as the inverse of the permutation pi1, where alpha'N, alpha'N-1, <1> ... , alpha'1, alpha'0 are N+1 additive transformations defined by the decrypt key, and where W represents the number of possibilities for each inverse permutation defined by the decrypt key. 2. The communication system of claim 1, wherein the encryption engine further includes W look-up tables for storing each of the possible W sets of permutations. 3. The communication system of claim 1, wherein the encryption engine further includes M < W look-up tables for storing M available sets of the possible W sets of permutations. 4. The communication system of claim 1, wherein the encryption engine further includes N < M < W look-up tables for storing N sets of permutations preselected from M available sets of the possible W sets of permutations. 5. The communication system of claim 1, wherein alphax(t) is a step function. 6. The communication system of claim 5, wherein alphaX(t), X={0, 1, 2, <1> .... , N-1, N}, increments the sequence of piX for each value that t equals an integer multiple of R, where R is a prime number. 7. The communication system of claim 5, wherein alphaX(t), X={0, 1, 2, <1> .... , N-1, N}, decrements the sequence of piX for each value that t equals an integer multiple of R, where R is a prime number. 8. The communication system of claim 5, wherein alphaX(t), X={0, 1, 2, <1> ..... , N-1, N}, increments the sequence of pix for each value of t except when t equals an integer multiple of R, where R is a prime number. 9. The communication system of claim 5, wherein alphaX(t), X={0, 1, 2, <1> .... , N-1, N}, decrements the sequence of piX for each value of t except when t equals an integer multiple of R, where R is a prime number. 10. The communication system of claim 1, wherein I't corresponds to It. 11. A communication system, comprising: a) an origination space; b) a communications channel; and c) a destination space associated with the origination space via the communications channel; d) wherein the origination space includes: 1) means for receiving an input symbol It, an encrypt key, and an encrypt text/key relation; and 2) an encryption engine, controllable by the encrypt text/key relation for generating an output symbol Ot based on the input symbol, such that Ot=alphaN(t) + piN[alphaN-1(t) + piN-1[alphaN-2(t) + . <1> .... + pi2[alpha1(t) + pi1[It + alpha0(t)]] ...]], mod W, where alphaN, alphaN-1, ..., alpha1, alpha0 are N+1 additive transformations defined by the encrypt key, where piN, piN-1, ..., pi2, pi1 are N permutations defined by the encrypt key, and where W represents the number of possibilities for each permutation defined by the encrypt key; and e) wherein the destination space includes: 1) means for receiving a decrypt key and a decrypt text/key relation; and 2) a decryption engine, controllable for generating a decrypted symbol I't based on the output symbol received from the origination space via the communications channel, such that I't=pi1<-1>[pi2<-1>[pi3<-1>...[pi.N-1<-1>-1(piN<-1>[Ot-alpha'N(t)]-alpha'N-1(t)]- ... -alpha'3(t)]-alpha'2(t)]- alpha'1(t)]-alpha'0(t), mod W, where pi1<-1> is defined by the decrypt key as the inverse of the permutation pi1<-1> where alpha'N, alpha'N-1, ..., alpha'1, alpha'0 are N+1 additive transformations defined by the decrypt key, and where W represents the number of possibilities for each inverse permutation defined by the decrypt key. 12. The communication system of claim 11, wherein the encryption engine further includes W look-up tables for storing each of the possible W sets of permutations. 13. The communication system of claim 11, wherein the encryption engine further includes M < W look-up tables for storing M available sets of the possible W sets of permutations. 14. The communication system of claim 11, wherein the encryption engine further includes N < M < W look-up tables for storing N sets of permutations preselected from M available sets of the possible W sets of permutations. 15. The communication system of claim 11, wherein alpha(t) is a step function. 16. The communication system of claim 15, wherein alphaX(t), X={0, 1, 2, ..... , N-1, N}, increments the sequence of pix for each value that t equals an integer multiple of R, where R is a prime number. 17. The communication system of claim 15, wherein alphaX(t), X={0, 1, 2, .... , N-1, N}, decrements the sequence of piX for each value that t equals an integer multiple of R, where R is a prime number. 18. The communication system of claim 15, wherein alphaX(t), X={0, 1, 2, .... , N-1, N}, increments the sequence of piX for each value of t except when t equals an integer multiple of R, where R is a prime number. 19. The communication system of claim 15, wherein alphaX(t), X={0, 1, 2, .... , N-1, N}, decrements the sequence of piX for each value of t except when t equals an integer multiple of R, where R is a prime number. 20. The communication system of claim 11, wherein I't corresponds to It. 21. A communication system, comprising: a) a first computer; b) a communications channel; and c) a second computer coupled with the first computer via the communications channel; d) wherein the first computer includes: 1 ) a symbol input port for receiving an input symbol It; 2) an encrypt key input port for receiving an encrypt key; 3) a first memory, for storing an encrypt text/key relation; and 4) a first microprocessor for generating an output symbol Ot based on the input symbol, controlled by the encrypt text/key relation such that Ot = alphaN(t) + piN[alphaN-1(t) + piN-1[alphaN-2(t) + . . . + pi2[alpha1(t) + pi1[It + alpha0(t)]] .... ]], mod W, where alphaN, alphaN-1, ...., alpha1, alpha0 are N+1 additive transformations defined by the encrypt key, where piN, piN-1, ...., pi2, pi1 are N permutations defined by the encrypt key, and where W represents the number of possibilities for each permutation defined by the encrypt key; and e) wherein the second computer includes: 1) a decrypt key input port for receiving a decrypt key; 2) a second memory, for storing a decrypt text/key relation; and 3) a second microprocessor for generating a decrypted symbol I't based on the output symbol received from the origination space via the communications channel, controlled by the decrypt text/key relation such that I't =pi1<-1>[pi2<-1>[pi3<-1> .... pi.N-1<-1>[piN<-1>[Ot-alpha 'N(t)]-alpha'N-1(t)]- . ....-alpha'3(t)]-alpha'2(t)]-alpha'1(t)]-alpha0(t), mod W, where pi1<-1>, is defined by the decrypt key as the inverse of the permutation pi1, where alpha 'N, alpha'N-1, ...., alpha'1, alpha'0 are N+1 additive transformations defined by the decrypt key, and where W represents the number of possibilities for each inverse permutation defined by the decrypt key. 22. The communication system of claim 21, wherein the first computer further includes W look-up tables for storing each of the possible W sets of permutations. 23. The communication system of claim 21, wherein the first computer further includes M < W look-up tables for storing M available sets of the possible W sets of permutations. 24. The communication system of claim 21, wherein the first computer further includes N < M < W look-up tables for storing N sets of permutations preselected from M available sets of the possible W sets of permutations. 25. The communication system of claim 21, wherein alpha(t) is a step function. 26. The communication system of claim 25, wherein alphaX(t), X={0, 1, 2, ..... , N-1, N}, increments the sequence of piX for each value that t equals an integer multiple of R, where R is a prime number. 27. The communication system of claim 25, wherein alphaX(t), X={0, 1, 2, ..... , N-1, N}, decrements the sequence of piX for each value that t equals an integer multiple of R, where R is a prime number. 28. The communication system of claim 25, wherein alphaX(t), X={0, 1, 2, ..... , N-1, N}, increments the sequence of piX for each value of t except when t equals an integer multiple of R, where R is a prime number. 29. The communication system of claim 25, wherein alphaX(t), X={0, 1, 2, ..... , N-1, N}, decrements the sequence of piX for each value of t except when t equals an integer multiple of R, where R is a prime number. 30. The communication system of claim 21, wherein I't corresponds to It. 31. A process for communication between an origination space and a destination space, comprising: a) receiving an input symbol It at the origination space; b) generating an output symbol Ot based on the input symbol, such that Ot=alphaN(t) + piN[alphaN-1(t)