Product ciphers are ciphers that are built as a composition of several different functions. In a special case when all the functions are the same, the cipher is called iterative cipher and the functions are called rounds. The intuition behind such constructions is inspired by the analogy with mixing transformations studied in the theory of Dynamical Systems, which was first noted by Shannon 3. The IBM team followed this approach in the design of Lucifer and the Data Encryption Standard (DES). Rounds of iterative ciphers are typically keyed with different subkeys or at least involve different round constants to break self-similarity, which otherwise would be vulnerable to slide attacks. Note that the individual round transformation might be cryptographically weak. The strength of the whole construction relies on the number of iterations. The choice of the proper number of rounds is a difficult task, which is performed via cryptanalysis of the cipher. Most of the modern block-ciphers...
References
Even, S. and O. Goldreich (1985). “On the power of cascade ciphers.” ACM Transactions on Computer Systems, 3, 108–116.
Maurer, U.M. and J.L. Massey (1993). “Cascade ciphers: The importance of being first.” Journal of Cryptology, 6 (1), 55–61.
Shannon, C.E. (1949). Communication theory of secrecy systems.” Bell System Technical Journal, 28, 656–715.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this entry
Cite this entry
Biryukov, A. (2005). Product Cipher, Superencryption. In: van Tilborg, H.C.A. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA . https://doi.org/10.1007/0-387-23483-7_320
Download citation
DOI: https://doi.org/10.1007/0-387-23483-7_320
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23473-1
Online ISBN: 978-0-387-23483-0
eBook Packages: Computer ScienceReference Module Computer Science and Engineering