Techniques for data encryption and decryption
View Patent ↗Techniques for securing data access are presented. A sender encrypts data into a first integer value. A first knot is selected along with first and second keys. The first knot, first integer value, first key, and second key are used to produce a final knot. The final knot is transmitted as a graphical image to a receiver over a network. The receiver uses the first knot, final knot, first key, and second key to derive the first integer value. The first integer value is decrypted to produce the original data that the sender intended to send securely to the receiver.
1. A processor-implemented method to execute on a computer processor, the processor configured to perform the method comprising:
receiving by the processor, a first knot;
securely exchanging, with a recipient device, a first symmetric key having a first value and a second symmetric key having a second value, the first value representing a series of knot processing transitions, the first value providing transition moves against the first knot and an order for each move;
repeatedly composing the first knot for a genus equal to the second value to produce a second knot using the moves and the order identified with the first value, each genus for each knot under composition is additive;
acquiring a block of data to encrypt as a block value;
repeatedly composing the first knot for a genus equal to the block value to produce a third knot;
performing, on the third knot, the series of knot processing transitions to produce a modified third knot using the moves and the order identified with the first value;
combining the modified third knot with the second knot to produce a fourth knot;
performing, on the fourth knot, the series of knot processing transitions to produce a final knot; and
sending the final knot to the recipient device as an encrypted version of the block of data.
2. The method of claim 1 , wherein receiving further includes acquiring the first knot as a processing parameter from a sender of the encrypted version of the block of data, the first knot of genus one.
3. The method of claim 2 , wherein acquiring further includes obtaining the first knot from the sender as a graphical image representation of the first knot.
4. The method of claim 1 , wherein securely exchanging further includes converting the first value into a converted integer value of base three, each digit in the converted integer value mapping to a particular Reidemeister knot transition.
5. The method of claim 1 , wherein acquiring further includes obtaining the block value as a processing parameter from a sender.
6. The method of claim 5 , wherein obtaining further includes identifying the block value as a digital signature received from the sender for the block of data.
7. The method of claim 1 , wherein sending further includes transmitting the final knot as a graphical image to the recipient.
8. A processor-implemented method to execute on a computer processor, the processor configured to perform the method comprising:
securely receiving by the processor from a sender device a first symmetric key represented by a first value and a second symmetric key represented by a second value;
acquiring a first knot and a second knot from the sender device;
performing, on the first knot, and in a reverse order a series of knot transitions defined by the second value to acquire a third knot, each knot transition and an order for the series of knot transitions defined in the second value;
repeatedly composing the second knot for a genus equal to the first value to acquire a fourth knot using the series of knot transitions and the order;
removing the fourth knot from the third knot to acquire a fifth knot;
performing, on the fifth knot, the series of knot transitions in the order defined in the reverse order by the second value to derive a sixth knot; and
counting a total number of twists in the sixth knot when compared to the second knot to acquire a decrypted integer value that was encrypted within the first knot.
9. The method of claim 8 further comprising, mapping the decrypted integer value to original data that the sender intended for a recipient and which was embedded within the first knot.
10. The method of claim 8 , wherein securely receiving further includes converting the second value into a base three integer value with each digit of the base three integer value representing a particular one of the knot transitions.
11. The method of claim 10 , wherein converting further includes selecting any particular knot transition from one of three Reidemeister knot moves.
12. The method of claim 8 , wherein acquiring further includes obtaining the first and second knots as graphical images transmitted from the sender.
13. The method of claim 8 , wherein acquiring further includes obtaining the first and second knots as a set of coordinate points defining the first and second knots.
14. The method of claim 8 , wherein removing further includes performing pattern recognition or image comparison algorithms to find and remove the fourth knot from the third knot.