Timeline for Taking advantage of one-time pad key reuse?
Current License: CC BY-SA 3.0
15 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Sep 19, 2019 at 21:30 | review | Suggested edits | |||
Sep 19, 2019 at 22:05 | |||||
Aug 4, 2016 at 0:27 | history | protected | Maarten Bodewes♦ | ||
May 26, 2016 at 17:21 | comment | added | Maarten Bodewes♦ | Note that this question will also cover key stream reuse as generated by most stream ciphers such as RC4 or a block cipher in a mode of operation that generates a key stream such as AES-CTR. (OK, that should take care of the search engines :P ) | |
Sep 4, 2013 at 5:18 | answer | added | Abijith Kp | timeline score: 39 | |
Jul 30, 2013 at 4:06 | answer | added | AndrewH | timeline score: 5 | |
Nov 27, 2012 at 1:02 | history | tweeted | twitter.com/#!/StackCrypto/status/273230364003160065 | ||
Jun 21, 2012 at 7:22 | history | edited | Paŭlo Ebermann |
edited tags
|
|
Jul 14, 2011 at 21:05 | answer | added | Jack Lloyd | timeline score: 12 | |
Jul 14, 2011 at 13:33 | history | edited | ir01 |
edited tags
|
|
Jul 14, 2011 at 11:55 | answer | added | foobarfuzzbizz | timeline score: 2 | |
Jul 13, 2011 at 23:46 | answer | added | davidlowryduda | timeline score: 176 | |
Jul 13, 2011 at 20:50 | answer | added | uygar.raf | timeline score: 4 | |
Jul 13, 2011 at 7:01 | comment | added | Mr_CryptoPrime | Well, what you are doing is using a randomly generated key and combining it with the plaintext to form the ciphertext. If it is used more than once, then you could find out how the key and plaintext are being used to form the ciphertext, then exploit this to deduce some letters? Further, use common cryptanalysis techniques to solve (letter frequency, bigrams, etc...)? This might help: cs.utsa.edu/~wagner/laws/pad.html | |
Jul 13, 2011 at 6:57 | answer | added | ir01 | timeline score: 34 | |
Jul 13, 2011 at 3:24 | history | asked | Elliott | CC BY-SA 3.0 |