Timeline for Implement a One-Time Pad
Current License: CC BY-SA 3.0
24 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 30, 2020 at 8:38 | answer | added | Razetime | timeline score: 4 | |
| Sep 5, 2014 at 0:48 | answer | added | wolfhammer | timeline score: 1 | |
| Aug 1, 2014 at 16:05 | comment | added | Christopher King |
@PhiNotPi I have a suggestion. Why not give a bonus if they use a truly random source (like /dev/hwrng, instead of using pseudo random (which technically makes it broken.)
|
|
| Jul 31, 2014 at 19:29 | answer | added | Farami | timeline score: 1 | |
| Jul 30, 2014 at 8:58 | answer | added | jpjacobs | timeline score: 1 | |
| Jul 30, 2014 at 5:20 | answer | added | es1024 | timeline score: 0 | |
| Jul 30, 2014 at 1:35 | answer | added | addison | timeline score: 0 | |
| Mar 3, 2013 at 20:59 | comment | added | ixtmixilix |
this would have been more fun IMO to leave randomness out of the problem; given a source of randomness (/dev/random, haveged), encrypt by xoring the ords with the bytes and decrypt by xoring them with the key. gist.github.com/5078264 the key or the randomness can be read from stdin, the message or cyphertext can be a filename argument.
|
|
| Mar 25, 2012 at 14:00 | vote | accept | PhiNotPi | ||
| Mar 25, 2012 at 14:00 | vote | accept | PhiNotPi | ||
| Mar 25, 2012 at 14:00 | |||||
| Mar 25, 2012 at 12:22 | answer | added | tomcant | timeline score: 1 | |
| Mar 22, 2012 at 8:39 | history | tweeted | twitter.com/#!/StackCodeGolf/status/182748366109802497 | ||
| Mar 17, 2012 at 23:20 | answer | added | jsvnm | timeline score: 4 | |
| Mar 17, 2012 at 16:06 | answer | added | commando | timeline score: 3 | |
| Mar 17, 2012 at 14:33 | answer | added | Ilmari Karonen | timeline score: 8 | |
| Mar 17, 2012 at 8:59 | answer | added | hammar | timeline score: 3 | |
| Mar 17, 2012 at 1:20 | answer | added | Scott Logan | timeline score: 1 | |
| Mar 16, 2012 at 23:04 | comment | added | PhiNotPi | @dmckee Regarding your first comment, I agree, which is why I do not intend to use these answers to secure my communications. | |
| Mar 16, 2012 at 22:46 | comment | added | dmckee --- ex-moderator kitten | Also, all challenges are language agnostic by default, so I've removed that tag. | |
| Mar 16, 2012 at 22:46 | history | edited | dmckee --- ex-moderator kitten |
edited tags
|
|
| Mar 16, 2012 at 22:45 | comment | added | dmckee --- ex-moderator kitten | Not to criticize the challenge on it's own merits (which are fine), but I am going to criticize the cryptography here. What you are describing is a "stream cipher" as it depends on a PRNG (unless your computer has access to a source or real randomness (and if the linux implementation of /dev/urandom counts is a matter of some debate)), and having the key developed at enciphering time defeats the only really good use for a OTP which is time shifting of secure communications. | |
| Mar 16, 2012 at 22:33 | history | edited | PhiNotPi | CC BY-SA 3.0 |
added 94 characters in body
|
| Mar 16, 2012 at 22:17 | answer | added | Gordon Bailey | timeline score: 2 | |
| Mar 16, 2012 at 20:21 | history | asked | PhiNotPi | CC BY-SA 3.0 |