Article View: sci.crypt
Article #2007New Encryption - a Challenge
From: Erik.Lindano
Date: Wed, 18 Nov 1992 21:32
Date: Wed, 18 Nov 1992 21:32
15 lines
736 bytes
736 bytes
Writes boucher@csl.sri.com (Peter K. Boucher): > 1) It's not worth the effort to try to crack it, since... OK. Don't try, then. > 3) A person would be foolish to use an encryption product whose > algorithm is unknown, because the provider might have a way to > always see cleartext. Yes, I have heard something like that about the DES and RSA algorithms. Have you? --- Maximus 2.00
Technical Details
Message-ID:
<n0ee5t@ofa123.fidonet.org>Path:
arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!usc!news.service.uci.edu!ucivax!ofa123!Erik.LindanoShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!usc!news.service.uci.edu!ucivax!ofa123!Erik.Lindano From: Erik.Lindano@ofa123.fidonet.org Newsgroups: sci.crypt Subject: New Encryption - a Challenge X-Sender: newtout 0.02 Nov 17 1992 Message-ID: <n0ee5t@ofa123.fidonet.org> Date: 18 Nov 92 21:32:24 Lines: 15