Skip to main content
SpringerLink
Log in

Hardware Design and Analysis of Block Cipher Components

  • Conference paper
  • First Online:
Information Security and Cryptology — ICISC 2002 (ICISC 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2587))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C.E. Shannon, “Communication Theory of Secrecy Systems”, Bell System Technical Journal, vol. 28, pp. 656–715, 1949. 164

    MathSciNet  Google Scholar 

  2. 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

    Google Scholar 

  3. 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

    Google Scholar 

  4. 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

  5. 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

    Google Scholar 

  6. 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

  7. 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

  8. 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

    Google Scholar 

  9. 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

  10. 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

  11. 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

    Google Scholar 

  12. 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

    Google Scholar 

  13. 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

    Google Scholar 

  14. 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

    Google Scholar 

  15. F. J. MacWilliams and N. J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977. 168, 169

    Google Scholar 

  16. 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

    Google Scholar 

  17. 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

  18. 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

    Google Scholar 

  19. 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

    Chapter  Google Scholar 

  20. A. Rudra, Personal Communication. 176, 177, 178

    Google Scholar 

  21. V. Rijmen, “Efficient Implementation of the Rijndael S-box”, available on: http://www.esat.kuleuven.ac.be/~rijmen/rijndael. 177

Download references

Author information

Authors and Affiliations

  1. Electrical and Computer Engineering Faculty of Engineering and Applied Science, Memorial University of Newfoundland St. John’s, A1B 3X5, NF, Canada

    Lu Xiao & Howard M. Heys

Authors
  1. Lu Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Howard M. Heys
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Pohnag University of Science and Technology, San 31, Hyoja-dong, Nam-gu, Pohang, 790-784, Kyungbuk, Korea

    Pil Joong Lee

  2. Sejong University, 98, Gunja-dong, Gwangjin-gu, 143-747, Seoul, Korea

    Chae Hoon Lim

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation