Now we can make a quick estimate - how many choices does the cipher present to a cryptanalyst. Sure, this is not the clear-cut case of random algorithm, only parameters are random, but this is already something that is worth estimating. This gives 128 bits of Master Booze, already a significant amount of confusion. Then the 8 rounds with 16-bit subkeys contribute additional 128 bits of Peer Booze. In my humble view, the total amount of Booze consumed in this cipher is close to 256 bits, so the only way of breaking it will be the brute force guessing of the plaintext.
Brute force cracking the key is out of question.
This was a far more demanding customer, and it provided opportunity for some fine points which I hope can be used in other areas beyond this case study. Nevertheless, this version had a neat routine for Modular Multiplication, and that alone justified the choice. Constants defined in the program also turned out to be quite useful. Before we turn on to the cipher itself, a couple of facts about modular multiplication need to be reminded. This called for some experimentation.