How can a time traveler encrypt info so it's only decryptable after a given date
A time traveler can generate a secure encryption key using astronomical events like novas or historical timestamps, ensuring unpredictability and reliability while minimizing human interaction for data access.
Read original articleA time traveler aiming to encrypt information for future access can utilize various methods to generate an encryption key that becomes available only after a specified time. One proposed approach involves using astronomical events, such as novas, to create a secure key. The traveler could instruct users to record the coordinates of novas occurring within a specific five-year period, converting these coordinates into binary format and concatenating them to form a 256-bit key using SHA-256 hashing. This method ensures unpredictability and security, as novas cannot be predicted in advance.
Alternatively, the traveler could rely on historical events or timestamps, such as the last few binary digits of Unix timestamps from significant occurrences, to generate a long and complex key. This would allow for lower accuracy measurements while still achieving a secure encryption standard.
Another suggestion involves using tamper-proof devices that automatically release the encrypted data at predetermined intervals, minimizing human interaction and the risk of premature access. Additionally, low-tech solutions, such as depositing instructions with lawyers to be opened at a specific date, could serve as a backup method for key retrieval.
Overall, the key generation process must balance security, reliability, and the ability to withstand potential technological advancements or changes in measurement accuracy over time.
Related
A Quantum Leap in Factoring
Recent quantum computing advancements include Peter Shor's Shor algorithm for factoring large numbers and Oded Regev's new scheme reducing gate requirements. Practical implications and implementation challenges persist despite optimism for future cryptography improvements.
How random are TOTP codes?
The blog post examines TOTP code randomness using HMAC with SHA-1. It analyzes digit frequency in generated codes, showing diminishing bias over generations. Readers discuss and suggest additional analysis methods.
Did a broken random number generator in Cuba help expose an espionage network?
A cryptologic mystery involving a broken random number generator in Cuba exposes a Russian espionage network. Anomalies in encrypted shortwave radio transmissions lead to the arrest of Russian spies, highlighting vulnerabilities in one-time pad ciphers.
https://en.wikipedia.org/wiki/R_Scuti
* The light from it is variable,
* This variation is continuous, not a rare event,
* It's 4,000 light years away, so the butterfly effect is irrelevant because the light is already on its way,
* It's chaotic and unpredictable.
Basically a reliable stream of random data. I guess the only problem is that you need to know what observations of its light levels were, throughout the 80s, if the records even exist.
Edit: "The AAVSO International Database currently contains over 110,000 observations of this erratic star spanning nearly a century of activity." There you go, that should provide a thousand measurements to base a key on in any given year.
“ I hacked time to recover $3 million from a Bitcoin software wallet”
Just put a program in the computer that generates a ‘random’ key based on time of day and second…and it does this every day at pre defined hours…and maybe some way that the time and date can’t be modified. Then, only when that day and time comes will the right key be generated and the files decrypted. Program does not know when that date is it just bases the key generation on time and date.
They even provided a fully operational, web-based, open-source implementation: https://timevault.drand.love
If you are protecting the secret from non-time travelers, you're probably fine, but if you are protecting it from other time travellers, your compute or proof of work has to be more expensive than their time-travel propulsion energy units.
We have this same problem with device attestation, where if the key exists in the same "universe" (hardware substrate) as the ciphertext, you're effectively fighting time travellers because they can run, re-run, use side channels, insert a breakpoint anywhere along the way. The current solutions are in the domains of physical tamper proofing, "white box" cryptography and other obfuscation schemes, and ultimately fully homomorphic encryption (FHE).
FHE would be the necessary solution against time travellers in this case because no matter where in time they were, they would have to be present at the instant the compute operation completes- and then you're into a race condition against Planck time to see who can grab the result of the computation first when it finishes. (assuming they can't infer or predict the result earlier than the completion of the FHE computation, that earlier decryption rounds don't reduce the time it takes to brute force the rest of it in a parallel stopped-timeline, and that Planck time still means anything in a universe where time isn't unidirectional and scalar)
Writing wise, there would have to be a hitch in their time travel scheme where to work it needed randomness and a lack of precision for some important quantum uncertainty reason, and the race to be present for the FHE decryption before the time travellers resolved their precision problem would drive the plot.
don't be discouraged though, a cursory reading of scientific discovery shows that impossible is mostly a convention, and cryptography historically reduces to a gentleman's agreement.
Other than that the key must be based in a purely deterministic algorithm to be immune to butterfly factors, which can always be brute forced by accelerating the civilization to fractional relativistic velocities or bringing it close to an extremely massive object. (Leaving the keygen at rest) Of course other ways to brute force such a key generator are probably more practical, but a relativistic attack is the steel man for the impossibility of reliability.
Stealth might be the best bet, an undersea bouy that pops up and broadcasts the key at the specified time or something like that. But then again, a fast moving civilisation would get the key “early” from their frame, even for astronomical events.
I posit that there is no absolutely reliable delay, but stealth is probably the best practical hedge.
He's asking "how to decrypt only after a certain date" when in reality he should be asking "how to make information available after a certain date".
First key is stored at the center of Olympus Mons on Mars.
See drand, the distributed randomness beacon protocol at https://drand.love/
Related
A Quantum Leap in Factoring
Recent quantum computing advancements include Peter Shor's Shor algorithm for factoring large numbers and Oded Regev's new scheme reducing gate requirements. Practical implications and implementation challenges persist despite optimism for future cryptography improvements.
How random are TOTP codes?
The blog post examines TOTP code randomness using HMAC with SHA-1. It analyzes digit frequency in generated codes, showing diminishing bias over generations. Readers discuss and suggest additional analysis methods.
Did a broken random number generator in Cuba help expose an espionage network?
A cryptologic mystery involving a broken random number generator in Cuba exposes a Russian espionage network. Anomalies in encrypted shortwave radio transmissions lead to the arrest of Russian spies, highlighting vulnerabilities in one-time pad ciphers.