Method of encrypting and transmitting data and system for transmitting encrypted data
First Claim
1. A method of encrypting data, comprising:
- representing the data in binary format having words of X bits in length;
using at least one computer to;
perform a first reversible rearrangement of the order of the bits of each word of the data, utilizing a reference table;
perform a second reversible rearrangement of the order of the bits of each word of the data, utilizing the reference table; and
generate the reference table before representing the data in binary format, the reference table having a first row of m entries and r rows of n entries each, wherein m, n, and r are prime numbers.
3 Assignments
0 Petitions
Accused Products
Abstract
A method of encrypting and transmitting data and a system for transmitting encrypted data. The method includes one or more different encryption algorithms, and may include employing different encryption algorithms to achieve multiple levels of encryption. A first encryption algorithm is based upon multiple rearrangements of bits representing data to obtain encoded data. A second encryption algorithm is based upon performing multiple XOR operations on bits representing data so that each data word is at least encoded with previous data words. The system comprises first and second computers and a plurality of communication parameters. The two computers are communicably connected to a network, and the second computer is adapted to route a transmission to the first computer. The transmission includes a data part and a header part, both of which are encrypted by the second computer utilizing the communication parameters. The first computer decrypts the transmission utilizing the communication parameters.
-
Citations
47 Claims
-
1. A method of encrypting data, comprising:
-
representing the data in binary format having words of X bits in length; using at least one computer to; perform a first reversible rearrangement of the order of the bits of each word of the data, utilizing a reference table; perform a second reversible rearrangement of the order of the bits of each word of the data, utilizing the reference table; and generate the reference table before representing the data in binary format, the reference table having a first row of m entries and r rows of n entries each, wherein m, n, and r are prime numbers. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A method of encrypting data, comprising:
using at least one computer to; represent the data in binary format having words of X bits in length; perform a first reversible rearrangement of the order of the bits of each word of the data, utilizing a reference table; perform a second reversible rearrangement of the order of the bits of each word of the data utilizing the reference table; and generate the reference table before representing the data in binary format, the reference table having a first row of m entries and r rows of n entries each, wherein generating the reference table further includes assigning numbers to the entries of the reference table, one number per entry, wherein the number assigned to each entry in the first row is unique within the first row and the number assigned to each entry in each of the r rows is unique within each respective row, and wherein performing the first reversible rearrangement of the order of the bits in each word of the data comprises using the at least one computer to; group each word of the data into m groups of bits; arrange the numbers from the first row of the table into numerical order; correlate each of the groups of bits with one of the numbers from the first row of the table as arranged in numerical order; and rearrange the groups of bits based upon the numbers from the first row of the table as ordered in the first row of the table, and wherein grouping each word of the data into m groups of bits includes grouping each word of the data into m−
1 groups of p bits in length and one group of q bits in length, q being less than p.- View Dependent Claims (7, 8, 9, 10, 11)
-
12. A method of encrypting data, comprising:
using at least one computer to; represent the data in binary format having words of X bits in length; perform an XOR operation on a first data word utilizing a key and a first noise table word from a noise table, wherein the noise table is represented in binary format having words of X bits in length and the key is represented in binary format having a word of X bits in length; and perform the XOR operation on successive data words utilizing an immediately preceding XOR operation result and a subsequent noise table word, and the method further comprising generate the noise table prior to representing the data in binary format, the noise table having a greater size than the data, wherein generating the noise table comprises obtain a data sample which is greater in size than a random character table; identify a data sub-sample within the data sample, the data sub-sample being equal in size to a random character table which is at least 128 bytes in size; represent the data sub-sample in words of X bits in length; perform a first rearrangement of the order of the bits in each word of the data sub-sample utilizing a reference table; perform a second rearrangement of the order of the bits in each word of the data sub-sample utilizing the reference table; and perform successive XOR operations on each rearranged word of the data sub-sample, respectively, utilizing the random character table. - View Dependent Claims (13, 14, 15, 16, 17)
-
18. A method of encrypting data, comprising:
using at least one computer to; represent the data in binary format having at least a first word and a second word, both of X bits in length; perform a first reversible rearrangement of the order of the bits of each word of the data utilizing a reference table; perform a second reversible rearrangement of the order of the bits of each word of the data utilizing the reference table, the first and second reversible rearrangements generating a first rearranged word and a second rearranged word; perform an XOR operation on the first rearranged word utilizing a key and a first noise table word from a noise table, wherein the noise table and the key are represented in binary format having words of X bits in length and the key is represented in binary format having a word of X bits in length; and perform the XOR operation on a second rearranged word utilizing the key, a second noise table word subsequent to the first noise table word, and a result from performing the XOR operation on the first word utilizing the key and the first noise table word, and the method further including using the computer to generate the reference table before representing the data in binary format, the reference table having a first row of m entries and r rows of n entries each, wherein m, n, and r are prime numbers. - View Dependent Claims (19, 20, 21, 22)
-
23. A method of encrypting data comprising:
using at least one computer to; represent the data in binary format having at least a first word and a second word, both of X bits in length; perform a first reversible rearrangement of the order of the bits of each word of the data utilizing a reference table; perform a second reversible rearrangement of the order of the bits of each word of the data utilizing the reference table, the first and second reversible rearrangements generating a first rearranged word and a second rearranged word; perform an XOR operation on the first rearranged word utilizing a key and a first noise table word from a noise table, wherein the noise table and the key are represented in binary format having words of X bits in length and the key is represented in binary format having a word of X bits in length; and perform the XOR operation on a second rearranged word utilizing the key, a second noise table word subsequent to the first noise table word, and a result from performing the XOR operation on the first word utilizing the key and the first noise table word, wherein the first word is formed by using the computer to perform the XOR operation on a time and date indicator utilizing at least a message number. - View Dependent Claims (24, 25, 26, 27)
-
28. A method of transmitting encrypted data comprising:
using at least one computer to; represent the data in binary format having at least a first word and a second word, both of X bits in length, the first word being formed by performing an XOR operation on a time and date indicator utilizing a message number and a port offset indicator, wherein the time and date indicator, the port offset indicator, and the message number are each represented in binary format having a word of X bits in length; perform the XOR operation on the first word utilizing a key and a first noise table word from a noise table to generate a first encrypted word, wherein the noise table is represented in binary format having words of X bits in length and the key is represented in binary format having a word of X bits in length; perform the XOR operation on the second data word utilizing the key, a second noise table word subsequent to the first noise table word, and the encrypted first word to generate a second encrypted word, the encrypted data comprising the first and second encrypted words; and transmitting the encrypted data from a sender to a recipient. - View Dependent Claims (29, 30, 31)
-
32. A method of transmitting encrypted data comprising:
using at least one computer to; represent the data in binary format having at least a first word and a second word, both of X bits in length, the first word being formed by performing an XOR operation on a time and date indicator utilizing a message number and a port offset indicator, wherein the time and date indicator, the port offset indicator, and the message number are each represented in binary format having a word of X bits in length; perform a first reversible rearrangement of the order of the bits of each word of the data utilizing a reference table; perform a second reversible rearrangement of the order of the bits of each word of the data utilizing the reference table, the first and second reversible rearrangements generating a first rearranged word and a second rearranged word from the first word and the second word, respectively; perform the XOR operation on the first rearranged word utilizing a key and a first noise table word from a noise table to generate a first encrypted word, wherein the noise table is represented in binary format having words of X bits in length and the key is represented in binary format having a word of X bits in length; perform the XOR operation on the second rearranged word utilizing the key, a second noise table word subsequent to the first noise table word and, a first result from performing the XOR operation on the first word utilizing the key and the first noise table word to generate a second encrypted word, the encrypted data comprising the first and second encrypted words; and transmitting the encrypted data. - View Dependent Claims (33, 34, 35, 36, 39, 40, 41, 47)
-
37. A data transmission system comprising:
-
at least one first computer communicably connected to a network; at least one second computer communicably connected to the network and configured to route a transmission to the at least one first computer; wherein a plurality of communication parameters include (i) a message number, (ii) an encryption algorithm identifier, (iii) a first encryption key comprising a first key part for encryption and a second key part for decryption, and (iv) a second encryption key comprising a third key part for encryption and a fourth key part for decryption, wherein the at least one second computer is configured to (i) utilize the encryption algorithm identifier, the message number, and the first key part to encrypt a data part of the transmission to the at least one first computer, and (ii) utilize the encryption algorithm identifier and the third key part to encrypt a header part of the transmission, and wherein the at least one first computer is configured to (i) utilize the encryption algorithm identifier and the fourth key part to decrypt the header part and (ii) utilize the encryption algorithm identifier, the second key part, and the message number to decrypt the data part. - View Dependent Claims (38, 42, 43, 44, 45, 46)
-
Specification