The VMS as a possible chain encryption ( Mod 23 ).

[oshfdk]

I asked in the You are not allowed to view links. Register or Login to view. if a made up chain cipher is easy to decrypt. Now I have written a Python script that decrypts a given Voynich word using the same method. The result is then mapped according to frequency analysis (EVA > Latin). Admittedly, this is a rather rudimentary approach, I am primarily interested in decoding with MOD 23. The method is simple enough to be considered and also much more effective than a simple substitution. It could be implemented practically with a letter disk (like Alberti disk).

I think this encoding will increase the entropy.

As an experiment could you try encoding some very simple maybe even repetitive English (or Latin) text using this method? I suppose it will become something like qtopihfdsjnvmglcxwtaksdbnkfhdyf - pure randomness and few obvious patterns.