Largo wrote:Some time ago I worked on a proof-of-concept tool that can solve monoalphabetic substitutions distributed over the network. My solver uses a hillclimber in combination with simulated annealing, based on n-grams. This works quite well, but I have not managed to extend the solver in such a way that homophonic substitutions can be solved too.
Just extend it and it should work.
Largo wrote:How did you handle this in AZDecrypt?
Randomly initialize a symbol to letter key. Then have a loop that determines the iterations. Inside this loop go through the following procedure. Make one random change to the symbol to letter key, for instance, symbol 63 becomes letter L. Score the change with ngrams + ioc normalization, if improvement then keep the change, if not then discard it + your simulated annealing stuff and repeat.
Largo wrote:Where do you have the necessary knowledge? Have you thought up the procedures yourself or can you tell me about websites or papers that can help me?
I did not have any knowledge. I cannot think of a single paper that will actually help you. Just extend your current solver.