News for hackers. Stuff that matters.
Re:The two-time pad: midwife of information theory? by amelius on Wednesday July 18, 2018 @12:41PM (#17559884)
But what if you apply a transform to the one time pad after you have used it (e.g. xor it with a generator that is seeded with the leading bits of the pad). Would it still be easy to break?
Re:The two-time pad: midwife of information theory? by tptacek on Wednesday July 18, 2018 @01:07PM (#17560129)
You haven't described your proposal with enough precision to critique it, but presumably yes, it will be gravely broken, because the 70 years that followed the "2-time pad" attack described here was a series of attempts to come up with ciphers like this that actually worked, followed by the straightforward attacks that broke them.

At some point your level of sophistication hits that of Lucifer or DES (iterated, nonlinear, nontrivial differential characteristics) and you can declare it "pretty annoying to break" and start comparing it to modern ciphers.

I never thought to go looking before today but I do wonder what the pre-Lucifer designs looked like.

Re:The two-time pad: midwife of information theory? by kazinator on Wednesday July 18, 2018 @01:10PM (#17560143)
Of course that will be harder than just repeating it.

What you have now is a PRNG with a big seed/state vector.

Re:The two-time pad: midwife of information theory? by tptacek on Wednesday July 18, 2018 @01:19PM (#17560234)
If we're keeping with the theme of what was available before modern cryptography (my assumption), it'll be simple, because the generator will be something on the order of an LCG.