Method and system for performing secure electronic digital streaming

A method for encrypting a digital bit stream comprising:

• determining a message key by modular summing digits of an original key with digits of a random number, whereby the message key has a length equal to a length of the random number;
• generating a random order of numbers from 1 to k, wherein each number in the random order has m digits, where:
• m−1<log10 k≦m;
• stating at a predetermined position in a matrix and placing a first bit sequence of length j=log2 k, said first bit sequence representing a first number having m digits in the random order of numbers from 1 to k, moving to a next predetermined position in the matrix and placing a second bit sequence of length j=log2 k, said second bit sequence representing a second number having m digits in the random order of numbers from 1 to k, and continuing to place bit sequences of length j=log2 k, said bit sequences representing each of the numbers having m digits in the random order of numbers from 1 to k until all positions in the matrix are filled with bit sequences of length j=log3 k, said bit sequences representing all of the numbers having m digits in the random order of numbers from 1 to k,
• encrypting the message stream by:
• segmenting the message stream into a plurality of blocks of length j bits;
• using a column position and a row position of a first bit sequence disposed in a first position in the matrix, in which a plurality of bit sequences are distributed throughout, to identify the first bit sequence;
• encrypting the column position and the row position with a modular base-n formula to obtain an encrypted column position and an encrypted row position;
• and
• transmitting a second bit sequence disposed in the matrix at the encrypted column position and the encrypted row position as an encrypted version of the first bit sequence;
• and
• determining a number of false bits to be included in the encrypted digital stream.

An apparatus for encoding a bit stream comprising a processor executing a set of programming instructions to encode the bit stream, and a programmable media having stored therein:

• an original key;
• and
• a set of programming instructions for programming the processor, said instructions including:
• using a column position and a row position of a first bit sequence disposed in a first position in a table, in which a plurality of bit sequences are distributed throughout the table, to identify the first bit sequence;
• encrypting the column position and the row position with a modular base-n formula to obtain an encrypted column position and an encrypted row position;
• transmitting a second bit sequence disposed in the table at the encrypted column position and the encrypted row position as an encrypted version of the first bit sequence;
• and
• encrypting the random order of numbers from 1 to k by modular summing, using a base of n, predetermined digits of a first key derived from the original key and the digits of the random order of numbers from 1 to k, wherein only nonzero digits of the first key and nonzero results of the modular summing are used in the encryption process.

An apparatus for encrypting a bit stream comprising a processor executing a set of programming instructions to encrypt the bit stream, and a programmable media having stored therein:

• an original key;
• a set of programming instructions for programming the processor, said instructions including:
• determining a message key by modular summing digits of an original key with digits of a random number, whereby the message key has a length equal to a length of the random number;
• generating a random order of numbers from 1 to k, wherein each number in the random order has m digits, where:
• m−1<log10 k≦m;
• starting at a predetermined position in a matrix and placing a first bit sequence of length j=log2 k, said first bit sequence representing a first number having m digits in the random order of numbers from 1 to k, moving to a next predetermined position in the matrix and placing a second bit sequence of length j=log2 k, said second bit sequence representing a second number having m digits in the random order of numbers from 1 to k, and continuing to place bit sequences of length j=log2 k, said bit sequences representing each of the numbers having m digits in the random order of numbers from 1 to k until all positions in the matrix are filled with bit sequences of length j=log2 k, said bit sequences representing all of the numbers having m digits in the random order of numbers from 1 to k,
• encrypting the message stream by:
• segmenting the message stream into a plurality of blocks of length j bits;
• using a column position and a row position of a first bit sequence disposed in a first position in the matrix, in which a plurality of bit sequences are distributed throughout, to identify the first bit sequence;
• encrypting the column position and the row position with a modular base-n formula to obtain an encrypted column position and an encrypted row position;
• and
• transmitting a second bit sequence disposed in the matrix at the encrypted column position and the encrypted row position as an encrypted version of the first bit sequence;
• and
• determining a number of false bits to be included in the encrypted digital stream.

A method for decrypting an encrypted digital bit stream comprising:

• a) generating a first key from an original key by modular summing base-n predetermined digits of the original key to form digits of the first key;
• b) converting a first plurality (k) of m-bit bit sequences into a first plurality (k) of numbers;
• c) decrypting the first plurality (k) of numbers by modular summing base-n predetermined digits of the first key with predetermined digits of the first plurality (k) of numbers;
• d) using the decrypted first plurality (k) of numbers to create a matrix having all possible combinations of m-bit bit sequences distributed throughout, wherein each possible combination of bits occupies a unique position in the matrix;
• and
• e) determining a first position in the matrix of a first encrypted bit sequence;
• f) deriving a message key from the first key and the original key;
• g) decrypting an encrypted row number of the first position by modular summing base-n predetermined digits of the message key and the encrypted row number;
• h) decrypting an encrypted column number of the first position by modular summing base-n predetermined digits of the message key and the encrypted column number;
• i) locating a second bit sequence in the matrix based on the decrypted row number and decrypted column number;
• and
• j) returning the second bit sequence as the decrypted bit sequence, wherein in steps c), g) and h) a result of the modular summing base-n is discarded if zero, and a digit of the first key is skipped if zero.

A method for decrypting an encrypted digital bit stream comprising:

• generating a first key from an original key by modular summing base-n predetermined digits of the original key to form digits of the fist key;
• converting a first plurality (k) of m-bit bit sequences into a first plurality (k) of numbers;
• decrypting the first plurality (k) of numbers by modular summing base-n predetermined digits of the first key with predetermined digits of the first plurality (k) of numbers;
• using the decrypted first plurality (k) of numbers to create a matrix having all possible combinations of m-bit bit sequences distributed throughout, wherein each possible combination of bits occupies a unique position in the matrix;
• and
• determining a first position in the matrix of a first encrypted bit sequence;
• deriving a message key from the first key and the original key;
• decrypting an encrypted row number of the first position by modular summing base-n predetermined digits of the message key and the encrypted row number;
• decrypting an encrypted column number of the first position by modular summing base-n predetermined digits of the message key and the encrypted column number;
• locating a second bit sequence in the matrix based on the decrypted row number and decrypted column number;
• returning the second bit sequence as the decrypted bit sequence;
• and
• using the first key to decrypt header values, false bits and a random number.