Advertisement

Two Approaches for a Single-Chip FPGA Implementation of an Encryptor/Decryptor AES Core

  • Nazar A. Saqib
  • Francisco Rodríguez-Henríquez
  • Arturo Díaz-Pérez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2778)

Abstract

In this paper we present a single-chip FPGA full encryptor/decryptor core design of the AES algorithm. Our design performs all of them, encryption, decryption and key scheduling processes. High performance timing figures are obtained through the use of a pipelined architecture. Moreover, several modifications to the conventional AES algorithm’s formulations have been introduced, thus allowing us to obtain a significant reduction in the total number of computations and the path delay associated to them. Particularly, for the implementation of the most costly step of AES, multiplicative inverse in GF(28), two approaches were considered. The first approach uses pre-computed values stored in a lookup table giving fast execution times of the algorithm at the price of memory requirements. Our second approach computes multiplicative inverse by using composite field techniques, yielding a reduction in the memory requirements at the cost of an increment in the execution time. The obtained results indicate that both designs are competitive with the fastest complete AES single-chip FGPA core implementations reported to date. Our first approach requires up to 11.8% less CLB slices, 21.5% less BRAMs and yields up to 18.5% higher throughput than the fastest comparable implementation reported in literature.

Keywords

Block Cipher Advance Encryption Standard Composite Field FPGA Device Multiplicative Inverse 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bertoni, G., et al.: Efficient Software Implementation of AES on 32-bits Platforms. In: Kaliski Jr., B.S., Koç, Ç.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 159–171. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  2. 2.
    Daemen, J., Rijmen, V.: The Design of Rijndael, AES-The Advanced Encryption Standard. Springer, Heidelberg (2002)Google Scholar
  3. 3.
    Dandalis, A., Prasanna, V.K., Rolim, J.D.P.: A Comparitive Study of Performance of AES Candidates Using FPGAs. In: The 3rd Advanced Encryption Standard (AES3) Candidate Conference, New York, USA, April 13–14 (2000)Google Scholar
  4. 4.
    Elbirt, J., Yip, W., Chetwynd, B., Paar, C.: A FPGA implementation and Performance Evaluation of the AES Block Cipher Candidate Algorithm Finalists. In: The Third AES3 Candidate Conference, New York, April 13-14 (2000)Google Scholar
  5. 5.
    Gaj, K., Chodowiec, P.: Comparison of the Hardware Performance of the AES Candidates using Reconfigurable Hardware. In: The 3rd Advanced Encryption Standard (AES3) Candidate Conference, New York, USA, April 13-14 (2000)Google Scholar
  6. 6.
    Gladman, B.: The AES Algorithm (AES) in C and C++ (April 2001), URL: http://fp.gladman.plus.com/cryptography_technology/rijndael/index.htm
  7. 7.
    Guajardo, J., Paar, C.: Efficient Algorithms for Elliptic Curve Cryptosytems. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 342–356. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  8. 8.
    Ichikawa, T., Kasuya, T., Matsui, M.: Hardware Evaluation of the AES Finalists. In: The 3rd Advanced Encryption Standard (AES3) Candidate Conference, New York, USA, April 13-14 (2000)Google Scholar
  9. 9.
    McLoone, M., McCanny, J.V.: High Performance FPGA Rijndael Algorithm Implementations. In: Koç, Ç.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, pp. 65–76. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  10. 10.
    Morioka, S., Satoh, A.: An Optimized S-Box Circuit Architecture for Low Power AES Design. In: Kaliski Jr., B.S., Koç, Ç.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 172–186. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  11. 11.
    Paar, C.: Efficient VLSI Architectures for Bit Parallel Computation in Galois Fields: PhD thesis: Universitat GH Essen, VDI Verlag (1994)Google Scholar
  12. 12.
    Rudra, A., et al.: Efficient Rijndael Encryption Implementation with Composed Field Arithmetic. In: Koç, Ç.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, pp. 171–184. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  13. 13.
    Trappe, W., Washington, L.C.: Introduction to Cryptography with Coding Theory. Prentice-Hall, Upper Saddle River (2002)zbMATHGoogle Scholar
  14. 14.
    Xilinx Virtex, T.M.-E.: 1.8V Field Programmable Gate Arrays, URL (November 2000), http://www.xilinx.com
  15. 15.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Nazar A. Saqib
    • 1
  • Francisco Rodríguez-Henríquez
    • 1
  • Arturo Díaz-Pérez
    • 1
  1. 1.Computer Science Section, Electrical Engineering DepartmentCentro de Investigación y de Estudios Avanzados del IPNMéxico D.F.México

Personalised recommendations