| Path: | doc.ic.ac.uk!dds | 
| From: | dds@doc.ic.ac.uk (Diomidis Spinellis) | 
| Newsgroups: | sci.crypt | 
| Subject: | Re: Computer Shopper Challenge | 
| Date: | 1 Nov 1993 13:36:30 GMT | 
| Organization: | Dept of Computing, Imperial College, England | 
| Lines: | 21 | 
| Message-ID: | <2b33cu$4a6@frigate.doc.ic.ac.uk> | 
| References: | <1993Oct30.033130.1576@integrity.uucp> | 
| NNTP-Posting-Host: | scorch.doc.ic.ac.uk | 
| Content-Length: | 760 | 
>From article <1993Oct30.033130.1576@integrity.uucp>, by edr@mpd.tandem.com (Ed Rupp):
> Gee, the first thing I did with this was a frequency count.
> For SECRT1 we have:
> sp   e  t  i  n  o  h  a  r  2  $  w d0 cc \n  s  l e4 ae  u  * c
> 119 92 83 79 68 67 66 65 59 58 57 56 54 54 54 53 53 52 52 52 52 51 ...
> 
> Maybe the high counts for 0xD0 and 0xCC are PC text-mode line drawing
> characters?   That would account for the failure of the 'bit 7 off' 
> searches.
Yes, but they are not very common ones.
0xd0 looks like _|_|_
and 0xcc looks like | |_
		    | i-
Diomidis
-- 
Diomidis Spinellis    Internet: <dds@doc.ic.ac.uk>  UUCP: ...!uknet!icdoc!dds
Department of Computing, Imperial College, London SW7     #include "/dev/tty"
Newsgroup sci.crypt contents 
Newsgroup list 
Diomidis Spinellis home page
 
 Unless otherwise expressly stated, all original material on this page created by Diomidis Spinellis is licensed under a Creative Commons Attribution-Share Alike 3.0 Greece License.
Unless otherwise expressly stated, all original material on this page created by Diomidis Spinellis is licensed under a Creative Commons Attribution-Share Alike 3.0 Greece License.