Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10 5/3/83; site amd70.UUCP
Path: utzoo!watmath!clyde!amd70!phil
From: phil@amd70.UUCP (Phil Ngai)
Newsgroups: net.lang.c, net.crypt
Subject: Re: DES Breakability / Re: CBenson's Data Encryption Algorithm
Message-ID: <4625@amd70.UUCP>
Date: Tue, 8-May-84 15:36:42 EDT
Article-I.D.: amd70.4625
Posted: Tue May  8 15:36:42 1984
Date-Received: Wed, 9-May-84 01:36:48 EDT
References: <726@ihuxx.UUCP>, <3220@fortune.UUCP>, <1781@randvax.ARPA>
Organization: AMD, Santa Clara, CA
Lines: 21

Although the NSA may claim it would take them 10 years to break
text encrypted with DES, I would like to point out that there is at
least one IC (I won't say whose) that can encrypt at 1.7 megabytes
per second. That's equivalent to trying 242,857 56 bit keys per second.

60 sec * 60 min * 24 hr * 365 days = 31,536,000 sec
   ---      ---      ---      ----            ----
   min      hr       day      year            year

2 ** 56 = 7.2 x 10 ** 16

If you had 10,000 of these devices operating in parallel you could try
all 2 ** 56 combinations in one year. On the average, you'd get it in 6 months.
If you had a million, you'd get a solution in 2 days.

These calculations are rather simplistic but show what is possible I think.

Did I mention that AMD got a large order from the NSA recently? Oh, I'm
not supposed to talk about it. (just kidding, everyone)
-- 
Phil Ngai (408) 749-5286 {ucbvax,decwrl,ihnp4,allegra,intelca}!amd70!phil