Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Is there a function or system which is time depending in which the effort required to brute force the decryption increases with time? It is easy to break encryption from many years ago because computers are so much faster. Is there a system in which time is a component and as time passes then it gets harder & harder to decrypt? Perhaps there is a physical entropy component which degrades after time? Something akin to disappearing ink, but digital.

share|improve this question
Only quantum based crypto has a chance to fit. Indeed, computational based crypto becomes easier to break as your computing power increases (and computing power isn't going to decrease, unless there is a huge societal collapse). For quantum crypto, maintaining an intercepted (quantum) state intact for a long time is hard, so there is a chance that it could give a positive answer. – minar Aug 27 '13 at 17:09
@minar : $\:$ See this paper on long-term security. $\;\;\;$ – Ricky Demer Aug 27 '13 at 19:01
Doesn't seem useful in practice. It's easy to design huge security margins against brute-force into a system. Crypto doesn't get broken by brute-force nowadays. It's either broken by analysis (finding a flaw in the crypto) or circumvented (finding flaws in the software). The only potential brute-force attack that's not easy to prevent is a quantum computer, but we'll solve that in a few years as well. – CodesInChaos Aug 31 '13 at 15:18
@CodesInChaos It's a few years later, judging by the time stamp of your comment. Could I ask you to elaborate on any developments regarding "but we'll solve that in a few years as well"? Just curious, thanks! – Ella Rose May 1 at 1:43
@E.Rose Post quantum crypto, like McEliece, NTRU, hash signatures. There is some work on moving these from theoretical schemes to something used in practice. – CodesInChaos May 1 at 9:12
up vote 8 down vote accepted

Any protocol with long-term security becomes harder to break after the protocol execution has finished.

In the Bounded-Storage Model, protocols become harder of break as [information about the
randomizer that's not stored by the adversary] is lost. $\:$ (This point is similar to minar's observation.)

share|improve this answer
Thanks. I found a pointer to what I was thinking of: – minar Aug 27 '13 at 19:07
Ahh, I get it. So Alice & Bob can exchange a message with conventional encryption, synchronizing with a token, time, and length to look for in a torrent of random public data. Using that random data, they create a one-time pad to further encrypt their future messages. Even if Eve broke the original encryption several years later, she would have to have stored the terabyte/s random stream to find the one-time pad, which is practically impossible. – Chloe Jul 20 '14 at 6:39

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.