Le jeu 19/12/2002 à 15:18, Daniel Burrows a écrit : > On Thu, Dec 19, 2002 at 09:17:23AM +0100, PUYDT Julien <[EMAIL PROTECTED]> > was heard to say: > > Le mer 18/12/2002 à 18:45, Niels Möller a écrit : > > > use some other construction that is secure even if the enemy has infinite > > > computational power > > > > I'm pretty sure it isn't possible: > > One-time pads are definitely secure against any mathematical attack. > (if you assume that the bits of the key are perfectly random) > Basically, given an encrypted message, every key/plaintext combination > is equally likely.
Cool. How do you send your key (that is as long as your message, btw)? Snark on #hurd, #hurdfr