Timeline for Pen and Paper Authentication
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Sep 29, 2019 at 0:07 | history | edited | Patriot | CC BY-SA 4.0 |
"no" can be an adjective; "used to" is correct for something done in the past but no longer; the writer, in this case myself, should be consistent with pre-... Moreover, "pre-shared" is much more common on this website than "preshared".
|
| S Sep 29, 2019 at 0:07 | history | suggested | Hyu | CC BY-SA 4.0 |
fixed grammar and clearer structure
|
| Sep 28, 2019 at 21:28 | review | Suggested edits | |||
| S Sep 29, 2019 at 0:07 | |||||
| Aug 22, 2019 at 16:23 | history | edited | Patriot | CC BY-SA 4.0 |
added 233 characters in body
|
| Aug 4, 2019 at 12:54 | comment | added | Patriot | @PaulUszak I am with you. These are some interesting questions. I want to make the solutions work. | |
| Aug 4, 2019 at 12:45 | comment | added | Paul Uszak | This is what I was driving at with the other answer. It's very hard to apply modern strong MAC things to a paper based system. There has to be compromise. Or revert to the old ways of radio burst Morse transmission which doesn't need authentication. An acoustic (de)modulator would be simplish to make. | |
| Aug 4, 2019 at 12:21 | comment | added | Paul Uszak | There are some manual problems with a C (OTMAC). Those instructions start with using 340282366920938463463374607431768211507 for $q$ if chunking 128 bit groups. A OTP block is 8 bits (or even less). So you either go large (tricky with an abacus) or small and repeat 16 times (or more) per message with 1st prime $>2^8$ (257). Then you might need another 16 $x,y$ unique pairs. Option B (poly) is going to be similarly complex to compute as you've realised. | |
| Aug 4, 2019 at 6:27 | history | answered | Patriot | CC BY-SA 4.0 |