🚀 go-pugleaf

In article <1992Aug4.180852.11447@kpc.com> hollasch@kpc.com (Steve
Hollasch) writes: 
...
> I was playing around the other day with developing a transcripted 
> shorthand that is fairly secure.  
...
> What I ended up with last night is basically a simple substitution
> cipher with some tricks tossed in.  
...
> So are there other tricks for developing such an encryption?  Are
> there any references for this sort of thing?

I think there is a passage in _The_Codebreakers_, by David Kahn where
he discusses simple substitution-type ciphers like yours (I think it's
in a chapter on the early telegraph systems, but I'm not sure).

Anyway, I seem to recall the statement that simply removing all the
letter e's raises the security quite considerably.

(n.b.: I suspect that's sort of like saying adding 10^-4 to a number
like 10^-5 raises the value of that number quite a lot ... it's true,
but if you're on a scale of 0 - 10, who cares?)

-don