SYSTEM AND METHODS FOR KEYED COMMUNICATIONS CHANNEL ENCRYPTION AND DECRYPTION

• US 20170302444A1
• Filed: 04/18/2017
• Published: 10/19/2017
• Est. Priority Date: 04/19/2016
• Status: Abandoned Application

• Current Assignee: Phillip H. Gillaspy
• Original Assignee: Phillip H. Gillaspy
• Inventors: Gillaspy, Phillip H.
• Application Number:
  US15/490,158
• Publication Number:
  US 20170302444A1
• Time in Patent Office: Days
• CPC Class Codes: H04L 2209/34 Encoding or coding, e.g. Huffman coding or error correction
• CPC Class Codes: H04L 9/0618 Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation
• CPC Class Codes: H04L 9/0643 Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
• CPC Class Codes: H04L 9/0662 with particular pseudorandom sequence generator
• CPC Class Codes: H04L 9/0668 producing a non-linear pseudorandom sequence
• CPC Class Codes: H04L 9/0816 Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
• CPC Class Codes: H04L 9/0869 involving random numbers or seeds

Abstract

The present disclosure is directed to secure computations and transmission of encrypted data over a network. Two unequal unsigned integer numbers are used as keys, which are kept secret by users. Each key is supplied as the seed to a uniform pseudorandom number generator, and follows an algorithm to encrypt and decrypt a communications channel between two endpoints on the network. The communications channel is a stream of bits representing any data that may be represented or stored by a computer capable of processing binary data. In one illustrative embodiment, a network has multiple endpoints, such as different terminals disposed at different locations (for example, terminals at various branches of a financial institution that are connected to a common network). Using keys that are specific to transactions between specified terminals allows for greater security of the encrypted transmissions.

Claims

1. A computer implemented method for conducting encrypted communications over a computer network, comprising:

receiving a first bit stream for a communication in a first computer memory;

encrypting the first bit stream beginning at the first bit thereof using at least a first processor by

generating a first random number by supplying a first unsigned integer number as a first key to a first uniform pseudorandom number generator,

generating a second random number by supplying a second unsigned integer number which differs from the first unsigned integer number as a second key to a second uniform pseudorandom number generator,

calculating a first Deviation between the first random number and the second random number, and where the first Deviation is greater than or to equal zero, inverting next bit in the first bit stream to generate an encrypted bit stream;

transmitting the encrypted bit stream from the first computer memory over a computer network.

2. The computer implemented method of claim 1, further comprising, dividing the first bit stream into a set of shift registers with the number of shift registers randomly determined before encrypting the first bit stream.

3. The computer implemented method of claim 2, wherein dividing the first bit stream into a set of shift registers with the number of shift registers randomly determined comprises dividing the first bit stream into a set of shift registers where within each register the size of the shift is randomly determined and the subsequent implementation of the bit shifting within each shift register is randomly determined.

4. The computer implemented method of claim 1, wherein the first uniform pseudorandom number generator is a uniform pseudorandom real number generator.

5. The computer implemented method of claim 1, wherein the first uniform pseudorandom number generator is a uniform pseudorandom unsigned 8-bit integer generator.

6. The computer implemented method of claim 1, further comprising calculating a running sum of the absolute value of the difference of the first random number and the second random number and comparing the running sum to a first random threshold, and when the running sum exceeds the first random threshold, generating a first randomly generated seed value and a second randomly generated seed value and using the first randomly generated seed value and the second randomly generated seed value as the first key and the second key for the subsequent bit in the first bit stream.

7. The computer implemented method of claim 6, further comprising calculating an initial value for the first random threshold as half the maximum value of the range of the first uniform pseudorandom number generator multiplied by a first set value.

8. The computer implemented method of claim 7, further comprising that when the running sum exceeds the first random threshold, a new value for the first random threshold is recomputed as the first randomly generated seed value divided by 2^{(bit size cyclic redundancy check-11)}.

9. The computer implemented method for claim 1, further comprising

receiving the transmitted encrypted bit stream in a second computer memory;

decrypting the encrypted bit stream beginning at the first bit thereof using at least a second processor by

generating a third random number by supplying the first unsigned integer number as a first key to a third uniform pseudorandom number generator,

generating a fourth random number by supplying the second unsigned integer number which differs from the third unsigned integer number as a second key to a fourth uniform pseudorandom number generator,

calculating a second Deviation between the third random number and the fourth random number, and where second Deviation is greater than or to equal zero, inverting next bit in the encrypted bit stream to generate a decrypted bit stream, which is identical to the first bit stream.

10. The computer implemented method of claim 9, wherein the third uniform pseudorandom number generator is a uniform pseudorandom real number generator.

11. The computer implemented method of claim 9, wherein the fourth uniform pseudorandom number generator is a uniform pseudorandom unsigned 8-bit integer number generator.

12. The computer implemented method of claim 9, further comprising calculating a running sum of the absolute value of the difference of the third random number and the fourth random number and comparing the running sum to a second random threshold, and when the running sum exceeds the second random threshold, generating a third randomly generated seed value and a fourth randomly generated seed value and using the third randomly generated seed value and the fourth randomly generated seed value as the first key and the second key for the subsequent bit in the encrypted bit stream.

13. The computer implemented method of claim 12, further comprising calculating an initial value for the second random threshold as half the maximum value of the range of the first uniform pseudorandom number generator multiplied by a first set value.

14. The computer implemented method of claim 13, further comprising that when the running sum exceeds the second random threshold, a new value for the second random threshold is recomputed as the first randomly generated seed value divided by 2^{(bit size cyclic redundancy check-11)}.

15. A non-transitory storage medium having stored therein computer-executable instructions which, when executed by one or more hardware processors, implement and/or cause the implementation of one or more of the processes of claim 1.

16. A system, comprising:

a computing device including one or more hardware processors;

a non-transitory storage medium having stored therein computer-executable instructions which, when executed by the one or more hardware processors encrypts a first bit stream received by the system beginning at the first bit thereof by

generating a first random number by supplying a first unsigned integer number as a first key to a first uniform pseudorandom number generator,

generating a second random number by supplying a second unsigned integer number which differs from the first unsigned integer number as a second key to a second uniform pseudorandom number generator,

calculating a first Deviation between the first random number and the second random number, and where the first Deviation is greater than or to equal zero, inverting next bit in the first bit stream to generate an encrypted bit stream;

transmitting the encrypted bit stream from the first computer memory over a computer network.

17. The system of claim 16, wherein the system is operable to divide the first bit stream into a set of shift registers prior to encryption, with the number of shift registers randomly determined and where within each register the size of the shift is randomly determined and the subsequent implementation of the bit shifting within each shift register is randomly determined.

18. The system of claim 16, wherein the system is operable to calculate a running sum of the absolute value of the difference of the first random number and the second random number and compare the running sum to a first random threshold, and when the running sum exceeds the first random threshold, generate a first randomly generated seed value and a second randomly generated seed value and use the first randomly generated seed value and the second randomly generated seed value as the first key and the second key for the subsequent bit in the first bit stream.

19. The system of claim 18, wherein the system is operable to calculate an initial value for the first random threshold as half the maximum value of the range of the first uniform pseudorandom number generator multiplied by a first set value.

20. The system of claim 19, wherein the system is operable such that when the running sum exceeds the first random threshold, a new value for the first random threshold is recomputed as the first randomly generated seed value divided by 2^{(bit size cyclic redundancy check-11)}.