Method and apparatus for authentication and encryption service employing unbreakable encryption

A method for performing an unbreakable stream cipher for use in communicating between a first client and a second client comprising:

• employing an underdetermined system of equations when performing encryption of data communicated between the first and second clients, and maintaining the underdetermined system of equations throughout said encryption, wherein said encryption includes:
• for a first block of plaintext having a predetermined length, said first client:
• a) performing a modular addition of a first open return and a first key to generate a first return;
• b) performing a combine function using a second key and the first return to generate a first alphabet;
• c) performing an extract function using the second key and the first alphabet resulting in a first message key;
• d) performing a modular addition of the first message key with the first block of plaintext to obtain a first block of cipher text;
• and
• for a second block of plaintext having a length less than or equal to said predetermined length, said first client:
• e) performing a modular addition of the first return and a first message key to generate a next return;
• f) performing a combine function using the second key and the next return to generate a next alphabet;
• g) performing an extract function using the second key and the next alphabet resulting in a next message key;
• h) performing a modular addition of the next message key with the second block of plaintext to obtain a second block of cipher text;
• and
• i) for any subsequent blocks of plaintext each having a length less than or equal to said predetermined length, repeating steps e) through h), each time using a previously calculated next return generated during an immediately prior generation of a block of cipher text to replace the first return in step e) to generate the next return in step e) used in a next generation of a subsequent block of cipher text until there are no more blocks of plaintext to be encrypted, thereby creating any subsequent blocks of cipher text from said any subsequent blocks of plaintext;
• and
• sending by the first client a first encrypted message to the second client, which said first encrypted message includes a first client identification, the first open return, the first block of cipher text, the second block of cipher text, and said any subsequent blocks of cipher text created by said first client in step i).

An apparatus for communicating in an encrypted manner using unbreakable encryption comprising:

• a first processor employing an underdetermined system of equations when performing encryption of data, and maintaining the underdetermined system of equations throughout said encryption, said first processor performing said encryption by:
• creating a first stream of cipher text by:
• for a first block of plaintext having a predetermined length, said first processor:
• a) performing a modular addition of a first open return and a first key to generate a first return;
• b) performing a combine function using a second key and the first return to generate a first alphabet;
• c) performing an extract function using the second key and the first alphabet resulting in a first message key;
• d) performing a modular addition of the first message key with the first block of plaintext to obtain a first block of cipher text;
• and
• for a second block of plaintext having a length less than or equal to said predetermined length, said first processor:
• e) performing a modular addition of the first return and a first message key to generate a next return;
• f) performing a combine function using the second key and the next return to generate a next alphabet;
• g) performing an extract function using the second key and the next alphabet resulting in a next message key;
• h) performing a modular addition of the next message key with the second block of plaintext to obtain a second block of cipher text;
• and
• i) for any subsequent blocks of plaintext each having a length less than or equal to said predetermined length, repeating steps e) through h) each time using a previously calculated next return generated during an immediately prior generation of a block of cipher text to replace the first return in step e) to generate the next return in step e) used in a next generation of a subsequent block of cipher text until there are no more blocks of plaintext to be encrypted, thereby creating any subsequent blocks of cipher text from said any subsequent blocks of plaintext;
• and
• a first transmitter coupled to said first processor, said first transmitter sending a first encrypted message, which said first encrypted message includes a first client identification, the first open return, the first block of cipher text, the second block of cipher text, and said any subsequent blocks of cipher text created by said first client in step i);
• and
• a first receiver receiving said first encrypted message.

An apparatus for performing an unbreakable stream cipher comprising:

• a first server employing an underdetermined system of equations when performing encryption of data, and maintaining the underdetermined system of equations throughout said encryption;
• said first server to create an unbreakable stream of ciphertext;
• a second server to receive the unbreakable stream of ciphertext;
• for a first block of plaintext having a predetermined length, said first server:
• a) performing a modular addition of a first open return and a first key to generate a first return;
• b) performing a combine function using a second key and the first return to generate a first alphabet;
• c) performing an extract function using the second key and the first alphabet resulting in a first message key;
• d) performing a modular addition of the first message key with the first block of plaintext to obtain a first block of cipher text;
• and
• for a second block of plaintext having a length less than or equal to said predetermined length, said first server:
• e) performing a modular addition of the first return and a first message key to generate a next return;
• f) performing a combine function using the second key and the next return to generate a next alphabet;
• g) performing an extract function using the second key and the next alphabet resulting in a next message key;
• h) performing a modular addition of the next message key with the second block of plaintext to obtain a second block of cipher text;
• and
• i) for any subsequent blocks of plaintext each having a length less than or equal to said predetermined length, repeating steps e) through h) each time using a previously calculated next return generated during an immediately prior generation of a block of cipher text to replace the first return in step e) to generate the next return in step e) used in a next generation of a subsequent block of cipher text until there are no more blocks of plaintext to be encrypted, thereby creating any subsequent blocks of cipher text from said any subsequent blocks of plaintext;
• and
• sending by the first server a first encrypted message to the second server, which said first encrypted message includes a first server identification, the first open return, the first block of cipher text, the second block of cipher text, and said any subsequent blocks of cipher text created by said first server in step i).