Timeline for Using one-way hash functions as the encryption method
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 3, 2013 at 17:41 | comment | added | Richie Frame | It is not completely different every time, the words change but the syntax stays the same. | |
| Sep 3, 2013 at 11:43 | comment | added | ddddavidee | Yes, I agree. But it is still not secure. It is not IND as a start (try to encrypt a message $m_1 = A A A A A$ and a $m_2 = A B C D E$ [every single letter is a single word]). | |
| Sep 3, 2013 at 10:43 | comment | added | jj57 | Except that each key and algorithm will produce an entirely different unknown language each time. If you had just one key and one language then over time you could map the words from one language to the next. | |
| Sep 3, 2013 at 10:09 | history | answered | ddddavidee | CC BY-SA 3.0 |