Article View: sci.crypt
Article #2151Re: New Encryption - a Challenge
From: Ken Pizzini
Date: Sun, 22 Nov 1992 09:31
Date: Sun, 22 Nov 1992 09:31
26 lines
1628 bytes
1628 bytes
In article <n0ee5t@ofa123.fidonet.org> Erik.Lindano@ofa123.fidonet.org writes: >Writes boucher@csl.sri.com (Peter K. Boucher): > > > 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? I've never heard this of RSA, but during the development of DES there was some question about the selection of the S-boxes that made some wonder if there was a trap-door lurking there. This concern was also raised over the marginal key-lengthof 56 bits. But while the selection criterion used was kept secret, the whole algolrithm was made public and has withstood attack (in the public arena, anyway) for over a decade. And when differential cryptanalyasis was explored it was revealed that the S-boxes chosen for DES were stronger than likely by chance, and that longer keys don't add anything useful to DES's security. But the point is that both DES and RSA's algolrithms have been public and have withstood great scrutiny by the crypto field, and so far have resisted attack (save, perhaps, a few bits of DES). --Ken Pizzini
Technical Details
Message-ID:
<1992Nov22.093143.13549@nwnexus.WA.COM>Path:
arc1-ca.pugleaf.net!sparky!uunet!nwnexus!kenReferences:
<n0ee5t@ofa123.fidonet.org>Show Full Headers
Complete Article Headers
Newsgroups: sci.crypt Path: arc1-ca.pugleaf.net!sparky!uunet!nwnexus!ken From: ken@halcyon.com (Ken Pizzini) Subject: Re: New Encryption - a Challenge Message-ID: <1992Nov22.093143.13549@nwnexus.WA.COM> Sender: sso@nwnexus.WA.COM (System Security Officer) Organization: The 23:00 News and Mail Service References: <n0ee5t@ofa123.fidonet.org> Date: Sun, 22 Nov 1992 09:31:43 GMT Lines: 26