Xref: utzoo rec.games.mud:2753 alt.security:2056 comp.unix.wizards:24639 Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!apple!agate!darkstar!ucscb.UCSC.EDU!banshee From: banshee@ucscb.UCSC.EDU (Wailin' Through The Nets) Newsgroups: rec.games.mud,alt.security,comp.unix.wizards Subject: Re: Hacking Message-ID: <14018@darkstar.ucsc.edu> Date: 2 Apr 91 04:44:43 GMT References: <1991Mar27.094325.24599@en.ecn.purdue.edu> <1991Apr1.173824.20323@odin.corp.sgi.com> Sender: usenet@darkstar.ucsc.edu Reply-To: banshee@ucscb.UCSC.EDU (Wailin' Through The Nets) Followup-To: rec.games.mud Organization: University of California, Santa Cruz; Open Access Computing Lines: 21 I seem to recall pkr@sgi.com (Phil Ronzone) saying: > >Well, assuming 100,000 words of 13 characters each, for each of 4096 >possibilities, that gives us 5,324,800,000 bytes. Now, with the >750MB and 1.2G 5.25" disk drives around, I'd probably have to have >several of the drives, OR, maybe use a smaller dictionary. > >100,000 words is a LOT of words ..... > Don't be silly. Talk about 25000 words x 4096 permutations x 13 bytes. That gives you 1.3 x 10^9 bytes. Now figure this is all ascii and you can expect at least 50% compression ratios. So say 6.6 x 10^8 bytes. That'll fit on my gigabyte drive with room to spare. Wanna tell me that the NSA _doesn't_ have this kind of thing precomputed? -- The Wailer at the Gates of Dawn | johnv@metaware.com | #include | uunet!metaware!johnv | void puke(struct dinner *p) { free(p); } | banshee@ucsc{b,f}.UCSC.EDU | 2,3,5,7,13,17,19,31,61,89,107,127,521,607....| banshee@ucsc{b,f}.BITNET |