Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

As someone says, one-time pads are impossible to decrypt without they key. But you can guess the key or use some other brute force mechanism.

My guess, SHA-256 will fall to a quantum computing algo in a few years.



As someone says, one-time pads are impossible to decrypt without they key. But you can guess the key or use some other brute force mechanism.

Actually, you can't even reliably brute force a one time pad. The key is always the same length as the message. All plausible messages of length N are equally valid solutions for a brute forcing algorithm.


>All plausible messages of length N are equally valid solutions for a brute forcing algorithm.

Assuming there is no out-of-band information to use to attack the ciphertext then yes I agree is unlikely to find a unique solution.

Aside: I'd never considered that key length was dictated by the term "one-time pad".


You could be using a One Time Pad for key management. This is certainly feasible now, since a couple of Gigabytes of data is now considered a manageable amount.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: