Abstract
In this paper, we present a general framework for evaluating the performance characteristics of block cipher structures composed of S-boxes and Maximum Distance Separable (MDS) mappings. In particular, we examine nested Substitution-Permutation Networks (SPNs) and Feistel networks with round functions composed of S-boxes and MDS mappings. Within each cipher structure, many cases are considered based on two types of S-boxes (i.e., 4X4 and 8X8) and parameterized MDS mappings. In our study of each case, the hardware complexity and performance are analyzed. Cipher security, in the form of resistance to differential, linear, and Square attacks, is used to determine the minimum number of rounds required for a particular parameterized structure. Because the discussed structures are similar to many existing ciphers (e.g., Rijndael, Camellia, Hierocrypt, and Anubis), the analysis provides a meaningful mechanism for seeking efficient ciphers through a wide comparison of performance, complexity, and security.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
National Institute of Standards and Technology, “Data Encryption Standard (DES)”, Federal Information Processing Standard 46, 1977. 176
J. Daemen and V. Rijmen, “AES Proposal: Rijndael”, Advanced Encryption Standard, available on: http://csrc.nist.gov/encryption/aes/rijndael. 176, 179
K. Ohkuma, H. Muratani, F. Sano, and S. Kawamura, “The Block Cipher Hierocrypt”, Workshop on Selected Areas in Cryptography-SAC 2000, Lecture Notes in Computer Science 2012, Springer-Verlag, pp. 72–88, 2001. 176, 177, 178, 179, 180
P. Barreto and V. Rijmen, “The Anubis Block Cipher”, NESSIE Algorithm Submission, 2000, available on: http://www.cosic.esat.kuleuven.ac.be/nessie. 176, 190
P. Barreto and V. Rijmen, “The Khazad Legacy-Level Block Cipher”, NESSIE Algorithm Submission, 2000, available on: http://www.cosic.esat.kuleuven.ac.be/nessie. 176
L. Xiao and H. M. Heys, “Hardware Design and Analysis of Block Cipher Components”, accepted for presentation at the 5th International Conference on Information Security and Cryptology-ICISC 2002, Seoul, Korea, November 28–29, 2002. 176, 177, 183, 190
K. Aoki, T. Ichikawa, M. Kanda, M. Matsui, S. Moriai, J. Nakajima, and T. Tokita, “Camellia: A 128-bit Block Cipher Suitable for Multiple Platforms”, NESSIE Algorithm Submission, 2000, available on: http://www.cosic.esat.kuleuven.ac.be/nessie. 177
E. Biham and A. Shamir, “Differential cryptanalysis of DES-like cryptosystems”, Advances in Cryptology-CRYPTO’ 90, Lecture Notes in Computer Science 537, pp. 2–21. Springer-Verlag, 1991. 177
M. Matsui, “Linear Cryptanalysis Method for DES Cipher”, Advances in Cryptology-Eurocrypt’ 93, Lecture Notes in Computer Science 765, Springer-Verlag, pp. 386–397, 1993. 177
R. Anderson, E. Biham and L. Knudsen, “Serpent: A Proposal for the Advanced Encryption Standard”, AES Algorithm Submission, available on: http://www.cl.cam.ac.uk/~rja14/serpent.html 177
Toshiba Corporation, “Security Evaluation: Hierocrypt-3”, NESSIE Algorithm Submission, 2000, available on: http://www.cosic.esat.kuleuven.ac.be/nessie. 177
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977. 178, 180
V. Rijmen, J. Daemen, B. Preneel, A. Bosselaers, and E. De Win, “The cipher SHARK”, Workshop on Fast Software Encryption-FSE’ 96, Lecture Notes in Computer Science 1039, Springer-Verlag, pp. 99–112, 1997. 178, 179, 183
J. Daemen, L. R. Knudsen, and V. Rijmen, “The Block Cipher Square”, Workshop on Fast Software Encryption-FSE’ 97, Lecture Notes in Computer Science 1267, Springer-Verlag, pp. 54–68, 1997. 179
M. Kanda, Y. Takashima, T. Matsumoto, K. Aoki, and K. Ohta, “ Strategy for Constructing Fast Round Functions with Practical Security Against Differential and Linear Cryptanalysis”, Workshop on Selected Areas in Cryptography-SAC’ 98, Lecture Notes in Computer Science 1556, pp. 264–279, 1999. 180
M. Kanda, “Practical Security Evaluation against Differential and Linear Attacks for Feistel Ciphers with SPN Round Function”, Workshop on Selected Areas in Cryptography-SAC 2000, Lecture Notes in Computer Science 2012, Springer-Verlag, pp. 324–338, 2001. 181
C. Paar, “Efficient VLSI Architectures for Bit-Parallel Computation in Galois Fields”, Ph.D. Thesis, Institute for Experimental Mathematics, University of Essen, Germany, 1994. 182
J. Nechvatal, E. Barker, L. Bassham, W. Burr, M. Dworkin, J. Foti, and E. Roback, “Report on the Development of the Advanced Encryption Standard (AES)”, Report on the AES Selection from U. S. National Institute of Standards and Technology (NIST), available on: http://csrc.nist.gov/encryption/aes. 181
M. Matsui, “New Block Encryption Algorithm MISTY”, Workshop on Fast Software Encryption-FSE’ 97, Lecture Notes in Computer Science 1267, Springer-Verlag, pp. 54–68, 1997. 189
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xiao, L., Heys, H.M. (2003). Hardware Performance Characterization of Block Cipher Structures. In: Joye, M. (eds) Topics in Cryptology — CT-RSA 2003. CT-RSA 2003. Lecture Notes in Computer Science, vol 2612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36563-X_12
Download citation
DOI: https://doi.org/10.1007/3-540-36563-X_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00847-7
Online ISBN: 978-3-540-36563-1
eBook Packages: Springer Book Archive