Partial cryptographic key transport using one-time pad encryption
A method of securely encrypting data whereby a computing device can utilize a seed and a pin to generate a mantissa of an irrational number. The computing device can then utilize a portion of the mantissa as a one-time pad to encrypt data. The seed can be transmitted to a recipient via a graphical code to enable secure decryption by a recipient's computing device.
1. A method of securing data, comprising:
using, by a computing device, a seed and a pin to generate a portion of a mantissa of an irrational number;
using, by the computing device, the portion of the mantissa as a one-time pad;
encrypting, by the computing device, the data with the one-time pad;
utilizing, by the computing device, the seed as a first portion of a key;
utilizing, by the computing device, the pin as at least part of a second portion of the key:,
generating, by at least one of the computing device or a second computing device, a decryption key from the first potion of the key and the second portion of the key; and
decrypting, by the at least one of the computing device and the second computing device, the data using the decryption key.
2. The method of claim 1 , wherein the irrational number is a root of a number comprising the seed and pin.
3. The method of claim 2 , wherein the root is a square root or a cube root.
4. The method of claim 2 , wherein the root is a fractional root.
5. The method of claim 1 , wherein the irrational number is a root of a number comprising the seed and the pin, and ending in 2, 3, 7, or 8.
6. The method of claim 1 , further comprising using a concatenation of the seed and the pin to generate the portion of the mantissa.
7. The method of claim 1 , further comprising using a mathematical function of the seed and the pin to generate the portion of the mantissa.
8. The method of claim 7 , wherein the mathematical function comprises addition or subtraction.
9. The method of claim 7 , wherein the mathematical function comprises multiplication or division.
10. The method of claim 1 , further comprising randomly selecting the seed from among numbers that are neither primes nor quasi-primes.
11. The method of claim 1 , further comprising randomly selecting the seed from among numbers that are over a thousand digits.
12. The method of claim 1 , further comprising randomly selecting the seed from among numbers that are over ten thousand digits.
13. The method of claim 1 , wherein the one-time pad comprises at least 10,000 digits.
14. The method of claim 1 , wherein the one-time pad comprises at least as many digits as data positions in the data.
15. The method of claim 1 , wherein a binary representation of the one-time pad comprises at least as many digits as digits in a binary representation of the data.
16. The method of claim 1 , further comprises using a graphical code to distribute a public key.
17. The method of claim 16 , wherein the graphical code comprises a QR code.
18. The method of claim 17 , further comprising confounding the QR code with at least one code other than the public key.
19. The method of claim 1 , wherein the first portion of the key includes a start point of the one-time pad within the mantissa.