Ek0 Ek1 EK2 EK2n

Where EK(M) is an encryption function controlled with the key K. The key specifies what kind of substitution table is implemented by the encryption algorithm. Actually, it is impossible to construct such a table because of the large value of n (usually for practically used ciphers we have n 64 or 128 bits). However, selecting an algorithm and a key, we define a substitution table that sets the correspondence between plaintext blocks, M, and ciphertext blocks, C EK(M). For a given key, one...

References

Advanced Encryption Standard. 1997. Proceedings of the 4th International Workshop, Fast Software Encryption FSE '97, Ed. Eli Biham. Springer Verlag LNCS 1267 83-87. 2. Becker, W. 1979. Method and system for machine enciphering and deciphering. U.S. Patent 4157454. 3. Benes, V.E. 1962. Algebraic and topological properties of connecting networks. Bell Systems Technical Journal 41 1249-74. 4. Benes, V.E. 1965. Mathematical theory of connecting networks and telephone traffic. New York Academic...