Even though this implementation is fully operational, (i. e. it can be utilized to encrypt

arbitrarily chosen plaintext into ciphertext and vice versa), the main optimization parameter

of this implementation has not been execution speed but understandability.

Assembler programmers might throw their hands up in horror, looking at shifting or

substitution functions that have been coded algorithmically step-by-step instead of using

a simple predefined lookup table the primary goal of this ”educational” paper is to

explain in greater detail what has to be done, rather than how it could be done for speed

optimization reasons.-Even though this implementation is fully operational, (i. e. it can be utilized to encrypt

arbitrarily chosen plaintext into ciphertext and vice versa), the main optimization parameter

of this implementation has not been execution speed but understandability.

Assembler programmers might throw their hands up in horror, looking at shifting or

substitution functions that have been coded algorithmically step-by-step instead of using

a simple predefined lookup table　the primary goal of this ”educational” paper is to

explain in greater detail what has to be done, rather than how it could be done for speed

optimization reasons.