Guaranteed Delayed Message Delivery
Hello, this article is more an outline for reflection than a full-fledged article and its goal is to discuss one interesting and irrelevant topic.
Send the message to the interlocutor, quickly check the delivery, guarantee readability no earlier than after a specified time, and guarantee only the read ability itself, and not the reading itself.
Examples:
Additionally. If you need to protect yourself from the inquisitorial brute force, you need to provide a way to replace the message, for example, if we are talking about hiding the decryption key for a couple of months, then it would not be bad if opening a message with a fake key would result in deciphering something digestible - like on the truth.
And now to the first method (see method 1) - cryptographic methods. The bottom line: we encrypt so that no one can quickly decrypt it. Here we will talk about algorithms that can not be parallelized. I want to give ground for thinking about developing such methods. Here are examples of consecutive non-paralleling (hopefully) decryption functions:
Fibonnachi series
It is defined as x n = x n-1 + x n-2 , respectively, we can calculate x n-2 = x n - x n-1 to the end, where x 0 = x 2 - x 1 .
Then, when performing calculations, we need to constantly store only two operands. Of course, this is not about an arithmetic sum, but about a reversible binary operator.
')
Inverse function to f (f (... f (message) ...))
Encryption Algorithm:
The decryption algorithm is obvious - at each iteration of decryption we see the next necessary key.
I assume that the transition to partial decryption of intermediate values will not allow you to read the beginning of the message, but, in general, you can use the appropriate required encryption mode for security. Also, for the sake of humor, you can initially lengthen the original message garbage. For symmetric encryption, the encryption time will be commensurate with the decryption time, which, for example, does not bother me, for example, if I am the owner of a modern processor, which is faster to find.
Cryptographic error.
The explanations show that the recovery time depends on the processor architecture and its clock frequency. To avoid this, you can objectively stamp fast processors to calculate this single single function, then each person will have the fastest processor for a negligible price. Of course, for strategic purposes such consumer goods may not be suitable, but then you can think a bit and use the composite method (see method 11).
See also method 10. The topic of cryptographic services, if you think about them, gives a number of business ideas and network protocols, which have not yet seen the light. So far, implemented in practice, I know only certification, but, for sure, I just know very little; and storing rainbow tables is, in my opinion, not a very healthy topic, although it is modern.
Formulation of the problem
Send the message to the interlocutor, quickly check the delivery, guarantee readability no earlier than after a specified time, and guarantee only the read ability itself, and not the reading itself.
Scope of application
Examples:
- A testament for great-great-grandchildren? - incorrect statement of the problem, if they have not yet been born, because delivery is not guaranteed.
- The holy copywriters who care about the audience shoot the film and simultaneously launch it a) in movie theaters, b) officially in the torrent. In the torrent video is laid out in excellent quality, but with the possibility of opening in N months.
- Uncle Vasya wrote a book exposing secret materials and is not sure that after this he will be able to survive, but he wants to draw time and unleash it. He can lay out one chapter of his book a week, and together with the first chapter lay out the entire book in open access, but with reading postponed for a couple of months, the author’s non-random death is ultimately an impetus to even more promotion of information that is no longer possible to localize intercept.
- Flashmob. The all-seeing general is planning an attack on a virtual state in the virtual world [/ me winks]. Sends instructions with deferred reading to all his virtual subordinates and issues an order to read the instruction as early as possible, for example, everyone will succeed in 5 days.
- Fighting spam. Mr. X is not against receiving letters from strangers, but he wants to torture spammers, then he puts an asymmetrical lock on his box and, at the first request, gives the public key with deferred reading for 10 minutes. In this case, it is assumed that this is about overloading the spammers task, not just waiting, i.e. This is a special case of implementation.
Implementation methods
- Cryptographic. We will postpone reading the description of this method for the time of reading the next ten methods, if you still do not like goto.
- Astronomical. The use of global clocks, such as the exit of the planet due to the sun It will be possible and useful in those close times when any person will be able to discover previously unknown planets, i.e. approximately when the number of undetected planets available for detection will be slightly less than the number of all possible 128-bit UIDs of the 21st century. It is assumed that the necessary information for opening the data bag will be removed from the planet itself.
- Logistic. Delayed postmen, bank cells. This terribly outdated method suffers from timely delivery control.
- Logistic 2. We send a message to the moon, it is reflected and returned to Earth in a second. Beautiful, but not suitable - bad, that we again can not check the delivery in advance.
- Biological. If we need to transfer only a couple of bits, we can give the recipient a pack of flower seeds, and he will have to grow them until mid-summer, when he knows the color of the petals - and this will be the decisive moment. DNA scanners can ruin this promising primeval method.
- Biological 2. We transmit our gene through conception and thus we identify ourselves - we can assume that this was the message.
- A hardware solution with an alarm clock that gives a message at a specified time.
- Technological. We give the message in an unobvious form, for example, on an unmanifested film and then the recipient is forced to spend some time guaranteed to go to a photo lab.
- Network. We give the encrypted message immediately, and the password will be given by crones from 10 of some stipulated servers. It will be more beautiful if only the target recipient of our message knows about these servers, and it is better that he does not know them, but only was ready to receive email from someone.
- Corporatocratic. (Idea for Eurobusiness). In objective reality, there should be at least one intergalactic alien-protected uninterested office that will lay out a trillion public keys for encryption for the next million years, and public decryption keys will be published publicly one per second for that million years. At the children's level, it is realizable as two fingers, but for some reason I have never heard of such laboratories before.
- Composite. Well, yes, where to the engineer without such an obvious advanced proposal ...
Additionally. If you need to protect yourself from the inquisitorial brute force, you need to provide a way to replace the message, for example, if we are talking about hiding the decryption key for a couple of months, then it would not be bad if opening a message with a fake key would result in deciphering something digestible - like on the truth.
And now to the first method (see method 1) - cryptographic methods. The bottom line: we encrypt so that no one can quickly decrypt it. Here we will talk about algorithms that can not be parallelized. I want to give ground for thinking about developing such methods. Here are examples of consecutive non-paralleling (hopefully) decryption functions:
- Like the Fibonnachi series, only backwards (obverfibonachevsky-my method).
- Calculate the inverse function for f (f (f (... f (message) ..)))
Fibonnachi series
It is defined as x n = x n-1 + x n-2 , respectively, we can calculate x n-2 = x n - x n-1 to the end, where x 0 = x 2 - x 1 .
Then, when performing calculations, we need to constantly store only two operands. Of course, this is not about an arithmetic sum, but about a reversible binary operator.
')
Inverse function to f (f (... f (message) ...))
Encryption Algorithm:
- Take the original message of any length or just a password.
- We generate a key for, for example, symmetric encryption.
- Encrypt the message (password) with the key and add the key to the encrypted message (concatenation).
- (1-3) We generate a new similar key, encrypt and concatenate. We repeat it many times.
The decryption algorithm is obvious - at each iteration of decryption we see the next necessary key.
I assume that the transition to partial decryption of intermediate values will not allow you to read the beginning of the message, but, in general, you can use the appropriate required encryption mode for security. Also, for the sake of humor, you can initially lengthen the original message garbage. For symmetric encryption, the encryption time will be commensurate with the decryption time, which, for example, does not bother me, for example, if I am the owner of a modern processor, which is faster to find.
Cryptographic error.
The explanations show that the recovery time depends on the processor architecture and its clock frequency. To avoid this, you can objectively stamp fast processors to calculate this single single function, then each person will have the fastest processor for a negligible price. Of course, for strategic purposes such consumer goods may not be suitable, but then you can think a bit and use the composite method (see method 11).
See also method 10. The topic of cryptographic services, if you think about them, gives a number of business ideas and network protocols, which have not yet seen the light. So far, implemented in practice, I know only certification, but, for sure, I just know very little; and storing rainbow tables is, in my opinion, not a very healthy topic, although it is modern.
Source: https://habr.com/ru/post/214403/
All Articles