[Article] Testable signatures on VMS structure

[Labyrinthinesecurity]

M. Greshko took care to make Naibbe of plausible algorithmic complexity for late Medieval scholars. Yet, it is at the upper level of reasonable complexity for that time, I believe. The most difficult challenge when "forcing" Naibbe into matching the signatures will be to prevent a complexity explosion.

We can always imaging "ad hoc" generators that will match the signatures, but we must always keep in mind that they must be reasonably simple and realistic.

Edit: As I see, my question was now well worded. Without changing any of the mechanics of Naibbe cipher, is it possible to change its token to character assignments to make it compatible with other criteria?

Why would changing token to character assignments increase complexity? I was asking if fine tuning the assignment can make Naibbe compatible with other criteria.

I dont think so.  To give you an idea, Naibbe monograms and bigrams are drawn from tables at random, for example: it is a core feature of a slot grammar. But this is enough to break the expected signatures.