Transmitter for encoding information with randomly flipped bits and transmitting that information through a communications channel
View Patent ↗A transmitter encodes information with randomly flipped bits. A cipher key that includes for each letter of an alphabet a unique string of binary bits of length N and a total amount of bits M to be randomly flipped where M<N are stored using a secure memory. An information message that includes a series of one or more letters is received using a transmitter. The cipher key is read from the secure memory and at least one letter of the series is converted to a corresponding unique string of binary bits of length N. The total amount of bits M to flip are read from the secure memory, the M bits of the unique string are randomly selected, and the M bits are flipped to the opposite binary value. The string with M flipped bits is transmitted through a communications channel.
1. A system for encoding information with randomly flipped bits and transmitting that information through a communications channel, comprising:
a secure memory that stores a cipher key that includes for each letter of an alphabet a unique string of binary bits of length N and stores a total amount of bits M to be randomly flipped where M<N; and
a transmitter that
receives an information message that includes a series of one or more letters from the alphabet,
reads the cipher key from the secure memory and converts at least one letter of the series to a corresponding unique string of binary bits of length N of the cipher key,
reads the total amount of bits M to be randomly flipped from the secure memory, randomly selects M bits of the unique string of binary bits of the at least one letter, and flips the M bits of the unique string of binary bits to the opposite binary value, and
transmits the string of binary bits of length N with M flipped bits of the at least one letter through a communications channel.
2. The system of claim 1 , wherein the transmitter transmits the string of binary bits through the communications channel to a receiver and wherein the receiver reads the cipher key and the total amount of bits M to be randomly flipped from a second secure memory and decodes the received string of binary bits of length N with M flipped bits of the at least one letter by
comparing the received string of binary bits to each unique string of binary bits of each letter of the cipher key, and
identifying a letter of the cipher key as the at least one letter if exactly N-M bits of a string of the letter of the cipher key match N-M bits of the received string of binary bits.
3. The system of claim 1 , wherein M=N/2.
4. The system of claim 1 , wherein before transmitting the string of binary bits through a communications channel, the transmitter further compares the resulting string of binary bits of length N with M flipped bits to the cipher key to determine if the resulting string of binary bits and any strings of letters other than at least one letter of the series have exactly N-M bits of the same identity.
5. The system of claim 4 , wherein if the resulting string of binary bits and any strings of letters other than at least one letter of the series have exactly N-M bits of the same identity, the transmitter iteratively randomly reselects M bits of the unique string of binary bits of the at least one letter and flips the M bits of the unique string of binary bits to the opposite binary value until the resulting string of binary bits and all strings of letters other than at least one letter of the series do not have exactly N-M bits of the same identity.
6. A system for receiving information with randomly flipped bits from a communications channel and decoding that information, comprising:
a secure memory that stores a cipher key that includes for each letter of an alphabet a unique string of binary bits of length N and stores a total amount of bits M to be randomly flipped where M<N; and
a receiver that
receives at least one letter of a series of one or more letters of an information message from a communications channel as a string of binary bits of length N,
reads the cipher key and the amount of bits M from the secure memory, and
decodes the received string of binary bits of the at least one letter of the series by comparing the received string of binary bits to each unique string of binary bits of each letter of the cipher key and identifying a letter of the cipher key as the at least one letter of the series if exactly N-M bits of the letter of the cipher key match N-M bits of the received string of binary bits.
7. The system of claim 6 , wherein M=N/2.
8. The system of claim 6 , wherein the string of binary bits received by the receiver are transmitted to the communications channel by a transmitter and wherein the transmitter reads the cipher key from a second secure memory, converts the at least one letter to a corresponding unique string of binary bits of length N of the cipher key, reads the total amount of bits M to be randomly flipped from the second secure memory, randomly selects M bits of the unique string of binary bits of the at least one letter, and flips the M bits of the unique string of binary bits to the opposite binary value before transmitting the string of binary bits of length N with M flipped bits through the communications channel.
9. The system of claim 8 , wherein before transmitting the string of binary bits through a communications channel, the transmitter further compares the resulting string of binary bits of length N with M flipped bits to the cipher key to determine if the resulting string of binary bits and any strings of letters other than at least one letter of the series have exactly N-M bits of the same identity.
10. The system of claim 9 , wherein if the resulting string of binary bits and any strings of letters other than at least one letter of the series have exactly N-M bits of the same identity, the transmitter iteratively randomly reselects M bits of the unique string of binary bits of the at least one letter and flips the M bits of the unique string of binary bits to the opposite binary value until the resulting string of binary bits and all strings of letters other than at least one letter of the series do not have exactly N-M bits of the same identity.
11. A method for encoding information with randomly flipped bits and transmitting that information through a communications channel, comprising:
storing a cipher key that includes for each letter of an alphabet a unique string of binary bits of length N and storing a total amount of bits M to be randomly flipped where M<N using a secure memory;
receive an information message that includes a series of one or more letters from the alphabet using a transmitter;
reading the cipher key from the secure memory and converting at least one letter of the series to a corresponding unique string of binary bits of length N of the cipher key using the transmitter;
reading the total amount of bits M to be randomly flipped from the secure memory, randomly selecting M bits of the unique string of binary bits of the at least one letter, and flipping the M bits of the unique string of binary bits to the opposite binary value using the transmitter; and
transmitting the string of binary bits of length N with M flipped bits of the at least one letter through a communications channel using the transmitter.
12. The method of claim 11 , further comprising transmitting the string of binary bits through the communications channel to a receiver, reading the cipher key and the total amount of bits M to be randomly flipped from a second secure memory using the receiver, and decoding the received string of binary bits of length N with M flipped bits of the at least one letter using the receiver by
comparing the received string of binary bits to each unique string of binary bits of each letter of the cipher key, and
identifying a letter of the cipher key as the at least one letter if N-M bits of a string of the letter of the cipher key match N-M bits of the received string of binary bits.
13. The method of claim 11 , wherein M=N/2.
14. The method of claim 11 , wherein before transmitting the string of binary bits through a communications channel, comparing the resulting string of binary bits of length N with M flipped bits to the cipher key to determine if the resulting string of binary bits and any strings of letters other than at least one letter of the series have exactly N-M bits of the same identity using the transmitter.
15. The method of claim 14 , wherein if the resulting string of binary bits and any strings of letters other than at least one letter of the series have exactly N-M bits of the same identity, iteratively randomly reselecting M bits of the unique string of binary bits of the at least one letter and flipping the M bits of the unique string of binary bits to the opposite binary value until the resulting string of binary bits and all strings of letters other than at least one letter of the series do not have exactly N-M bits of the same identity using the transmitter.