Article View: sci.crypt
Article #1106Re: Proposed noise-based encryption method
From: Marc.Ringuette
Date: Wed, 30 Sep 1992 07:17
Date: Wed, 30 Sep 1992 07:17
15 lines
1191 bytes
1191 bytes
rahdert@thrombus.seas.upenn.edu (Dave Rahdert) writes, > the decryption key is...a list of random binary digits... > Each of the two parties owns a copy of this list... You have reinvented the one-time pad, which is extremely well-known and is, as you realized, unbreakable if the key is kept secret. You are exactly right in all of your analysis, and your suggestion of a pair of CDs-full of random data is also well-known and on target. So congratulations for getting it right, and a small kick in the pants for not looking it up in a book on cryptography (virtually any such book will have a discussion of one-time pads). -- Marc Ringuette (mnr@cs.cmu.edu)
Technical Details
Message-ID:
<BvDrJy.EHF.2@cs.cmu.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!ogicse!das-news.harvard.edu!cantaloupe.srv.cs.cmu.edu!mnrShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!ogicse!das-news.harvard.edu!cantaloupe.srv.cs.cmu.edu!mnr From: Marc.Ringuette@DAISY.LEARNING.CS.CMU.EDU Newsgroups: sci.crypt Subject: Re: Proposed noise-based encryption method Message-ID: <BvDrJy.EHF.2@cs.cmu.edu> Date: 30 Sep 92 07:17:00 GMT Article-I.D.: cs.BvDrJy.EHF.2 Sender: news@cs.cmu.edu (Usenet News System) Organization: School of Computer Science, Carnegie Mellon Lines: 15 Originator: mnr@DAISY.LEARNING.CS.CMU.EDU Nntp-Posting-Host: daisy.learning.cs.cmu.edu