This post and and the jb "essentially a one-time pad" notion, rather
'universal one-time pad' notion are interesting...
Rabin said the math to prove his discovery is 'hard'. The one-time pad
solution has been proven secure, under the assumption pads are not
compromised. Is it really that hard to prove that a time-stamped stream of
non-repeating random bits is the same as a universal one-time pad and that
said pad cannot be compromised?
As an aside, note that this method does not allow Bob and Alice to store
messages in a provably unbreakable format, just exchange them.
> -----Original Message-----
> From: Jeff Bone [mailto:email@example.com]
> Sent: Tuesday, February 20, 2001 10:29 AM
> To: firstname.lastname@example.org
> Subject: Crypto
This archive was generated by hypermail 2b29 : Fri Apr 27 2001 - 23:17:58 PDT