DECRYPTION OF SIMPLE SUBSTITUTION CYPHERS WITH WORD DIVISIONS USING A CONTENT ADDRESSABLE MEMORY
Rajendra S. Wall · Cryptologia · 1980
The problem of decrypting simple substitution cyphers can readily be solved by pencil and paper. It can also easily be attacked by various computerized approaches. This paper shows the results of a table look up approach aided by simulated content addressable memory hardware.