Abstract
This paper describes the efficient implementation of Maximum Distance Separable (MDS) mappings and Substitution-boxes (S-boxes) in gate-level hardware for application to Substitution- Permutation Network (SPN) block cipher design. Different implementations of parameterized MDS mappings and S-boxes are evaluated using gate count as the space complexity measure and gate levels traversed as the time complexity measure. On this basis, a method to optimize MDS codes for hardware is introduced by considering the complexity analysis of bit parallel multipliers. We also provide a general architecture to implement any invertible S-box which has low space and time complexities. As an example, two efficient implementations of Rijndael, the Advanced Encryption Standard (AES), are considered to examine the different tradeoffs between speed and time.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
C.E. Shannon, “Communication Theory of Secrecy Systems”, Bell System Technical Journal, vol. 28, pp. 656–715, 1949. 164
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. 164, 167
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. 164, 167
J. Daemen and V. Rijmen, “AES Proposal: Rijndael”, Advanced Encryption Standard, available on: http://csrc.nist.gov/encryption/aes/rijndael. 164, 165, 171, 174, 176
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. 164, 171, 174
P. Barreto and V. Rijmen, “The Anubis Block Cipher”, NESSIE Algorithm Submission, 2000, available on: http://www.cosic.esat.kuleuven.ac.be/nessie. 164, 171
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. 164, 171
A. Youssef, S. Mister, and S. Tavares, “On the Design of Linear Transformations for Substitution-Permutation Encryption Networks”, Workshop on Selected Areas in Cryptography-SAC’ 97, Ottawa, 1997. 164, 171
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. 166, 174
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 Standardsand Technology (NIST), available on: http://csrc.nist.gov/encryption/aes. 166
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. 166, 171
E.D. Mastrovito, “VLSI Design for Multiplication over Finite Fields GF(2m)”, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes-AAECC-6, Lecture Notes in Computer Science 357, pp. 297–309, 1989. 167, 177, 178
C. Paar, “Efficient VLSI Architectures for Bit-Parallel Computation in Galois Fields”, PhD Thesis, Institute for Experimental Mathematics, University of Essen, Germany, 1994. 167, 170, 177, 178, 181
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. 168, 171
F. J. MacWilliams and N. J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977. 168, 169
E. Biham, “A Fast New DES Implementation in Software”, Workshop on Fast Software Encryption-FSE’ 97, Lecture Notes in Computer Science 1267, Springer-Verlag, pp. 260–272, 1997. 168, 175, 178
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. 169
H. Kuo and I. Verbauwhede, “Architectural Optimization for a 1.82Gbits/sec VLSI Implementation of the AES Rijndael algorithm”, Workshop on Cryptographic Hardware and Embedded Systems-CHES 2001, Lecture Notes in Computer Science 2162, Springer-Verlag, pp. 51–64, 2001. 176
A. Rudra, P.K. Dubey, C. S. Jutla, V. Kumar, J.R. Rao, and P. Rohatgi, “Effcient Rijndael Encryption Implementation with Composite Field Arithmetic”, Cryptographic Hardware and Embedded Systems-CHES 2001, Lecture Notes in Computer Science 2162, Springer-Verlag, pp. 171–184, 2001. 176, 177, 178
A. Rudra, Personal Communication. 176, 177, 178
V. Rijmen, “Efficient Implementation of the Rijndael S-box”, available on: http://www.esat.kuleuven.ac.be/~rijmen/rijndael. 177
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 Design and Analysis of Block Cipher Components. In: Lee, P.J., Lim, C.H. (eds) Information Security and Cryptology — ICISC 2002. ICISC 2002. Lecture Notes in Computer Science, vol 2587. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36552-4_12
Download citation
DOI: https://doi.org/10.1007/3-540-36552-4_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00716-6
Online ISBN: 978-3-540-36552-5
eBook Packages: Springer Book Archive