Methods of storing and distributing large keys
A method for securely encrypting and decrypting data wherein a function is processed to obtain a raw key that is an irrational or transcendental number. A sending computing device applies a starting point and length to obtain a shortened key used for encryption. A receiving computing device identifies the function from a received identifier and applies the starting point and length to a mirroring raw key to derive the decryption key.
1. A method of generating and storing encryption keys, comprising:
selecting, by a sending computing device, a function;
solving, by the sending computing device, the function to obtain a raw key, wherein the raw key is one of an irrational number or a transcendental number;
selecting, by the sending computing device, a starting point designating at least one start digit within the raw key and a length indicating an amount of digits after the at least one start digit;
applying the starting point and length to the raw key to generate a shortened key;
encrypting a message with the shortened key; and
storing the selected function, the starting point and length in a memory.
2. The method of claim 1 , further comprising:
transmitting, by the sending computing device and to a receiving computing device, the encrypted message;
transmitting, by the sending computing device and to the receiving computing device, an indicator of the function, the starting point and the length;
obtaining, by the receiving computing device, the function based on the indicator of the function;
solving, by the receiving computing device, the function to generate a corresponding second raw key, wherein the second raw key is identical to the raw key;
applying the received starting point and length to the second raw key to generate a second shortened key; and
decrypting the encrypted message with the second shortened key.
3. The method of claim 2 , further comprising:
transmitting, by the sending computing device to the receiving device, a second encrypted message, a second starting point and a second length, wherein the second encrypted message was encrypted by using a third shortened key;
solving, by the receiving computing device, the function to regenerate the second raw key;
applying the second starting point and second length to the second raw key to generate a fourth shortened key; and
decrypting the second encrypted message using the fourth shortened key.
4. The method of claim 1 , wherein the function is a ratio, and storing the selected function comprises storing a first numerator value and a first denominator value of the ratio.
5. The method of claim 4 , wherein each of the first numerator value and the first denominator value are integers.
6. The method of claim 1 , wherein each of the starting point and length are integers.
7. The method of claim 1 , wherein the at least one start digit comprises a plurality of digits arranged in a sequence.
8. The method of claim 1 , further comprising, after applying the starting point to the raw key:
applying, by the sending computing device, a bouncing logic to select non-consecutive digits from the raw key until the length is reached; and
grouping the non-consecutive digits to form the shortened key.
9. The method of claim 1 , wherein solving the function comprises solving for the square root of a non-perfect square number.
10. The method of claim 9 , wherein the function comprises solving for the square root of twenty.