home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #23 / NN_1992_23.iso / spool / sci / crypt / 3832 < prev    next >
Encoding:
Internet Message Format  |  1992-10-16  |  1.1 KB
  1. Path: sparky!uunet!know!hri.com!ukma!usenet.ins.cwru.edu!agate!ames!elroy.jpl.nasa.gov!sdd.hp.com!zaphod.mps.ohio-state.edu!pacific.mps.ohio-state.edu!linac!uwm.edu!daffy!uwvax!uchinews!machine!chinet!schneier
  2. From: schneier@chinet.chi.il.us (Bruce Schneier)
  3. Newsgroups: sci.crypt
  4. Subject: Re: Using genetic engineering for exhaustive DES key search
  5. Keywords: exhaustive, DES, genetic engineering
  6. Message-ID: <Bw74r5.By0@chinet.chi.il.us>
  7. Date: 16 Oct 92 04:06:41 GMT
  8. References: <lou.717919152@cadence.com> <gH2JsB7w165w@works.uucp>
  9. Organization: Chinet - Public Access UNIX
  10. Lines: 16
  11.  
  12. In article <gH2JsB7w165w@works.uucp> hacker@works.uucp (DamDum) writes:
  13. >lou@Cadence.COM (Louis K. Scheffer) writes:
  14. >
  15. >> 
  16. >> While pondering the well known problem of DES cracking via exhaustive
  17. >> key search, I started wondering if you could apply genetic engineering to
  18.  
  19. Oddly enough, this idea hasn't only been thought of before, but it actually
  20. made it into a professional journal:
  21.  
  22.     Jean-Jacques Quisquater and Yvo G. Desmedt, "Chinese Lotto as an
  23.     Exhaustive Code-Breaking Machine," COMPUTER, Nov 91, pp. 14-22.
  24.  
  25. It's amazig how thing they're slicing the stuff these days.
  26.  
  27. Bruce
  28.