A High Speed Architecture for Galois/Counter Mode of Operation (GCM)

In this paper we present a fully pipelined high speed hardware architecture for Galois/Counter Mode of Operation (GCM) by analyzing the data dependencies in the GCM algorithm at the architecture level. We show that GCM encryption circuit and GCM authentication circuit have similar critical path delays resulting in an efficient pipeline structure. The proposed GCM architecture yields a throughput of 34 Gbps running at 271 MHz using a 0.18 μm CMOS standard cell library.

[1]  Russ Housley,et al.  Counter with CBC-MAC (CCM) , 2003, RFC.

[2]  염흥렬,et al.  [서평]「Applied Cryptography」 , 1997 .

[3]  Wlodzimierz Bielecki,et al.  Parallelization of Standard Modes of Operation for Symmetric Key Block Ciphers , 2006, Biometrics, Computer Security Systems and Artificial Intelligence Applications.

[4]  Vijay K. Bhargava,et al.  Bit-Serial Systolic Divider and Multiplier for Finite Fields GF(2^m) , 1992, IEEE Trans. Computers.

[5]  John Viega,et al.  The Security and Performance of the Galois/Counter Mode (GCM) of Operation , 2004, INDOCRYPT.

[6]  D. Wagner,et al.  A Conventional Authenticated-Encryption Mode , 2003 .

[7]  Keshab K. Parhi,et al.  High-speed VLSI architectures for the AES algorithm , 2004, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[8]  Ronald L. Rivest,et al.  The MD5 Message-Digest Algorithm , 1992, RFC.

[9]  Ingrid Verbauwhede,et al.  A 3.84 gbits/s AES crypto coprocessor with modes of operation in a 0.18-μm CMOS technology , 2005, ACM Great Lakes Symposium on VLSI.

[10]  Trieu-Kien Truong,et al.  A Comparison of VLSI Architecture of Finite Field Multipliers Using Dual, Normal, or Standard Bases , 1988, IEEE Trans. Computers.

[11]  Brent E. Nelson,et al.  Optimal Finite Field Multipliers for FPGAs , 1999, FPL.

[12]  Joan Daemen,et al.  AES Proposal : Rijndael , 1998 .

[13]  Sandra Dominikus,et al.  A Highly Regular and Scalable AES Hardware Architecture , 2003, IEEE Trans. Computers.

[14]  Donald E. Eastlake,et al.  US Secure Hash Algorithm 1 (SHA1) , 2001, RFC.

[15]  John Viega,et al.  The Use of Galois/Counter Mode (GCM) in IPsec Encapsulating Security Payload (ESP) , 2005, RFC.

[16]  Keshab K. Parhi,et al.  Efficient finite field serial/parallel multiplication , 1996, Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96.

[17]  Christof Paar,et al.  An FPGA-based performance evaluation of the AES block cipher candidate algorithm finalists , 2001, IEEE Trans. Very Large Scale Integr. Syst..

[18]  Christof Paar,et al.  Efficient Multiplier Architectures for Galois Fields GF(2 4n) , 1998, IEEE Trans. Computers.

[19]  PaarChristof,et al.  Efficient Multiplier Architectures for Galois Fields GF(24n) , 1998 .

[20]  Harald Niederreiter,et al.  Introduction to finite fields and their applications: Preface , 1994 .

[21]  Ingrid Verbauwhede,et al.  Minimum area cost for a 30 to 70 Gbits/s AES processor , 2004, IEEE Computer Society Annual Symposium on VLSI.

[22]  Tadayoshi Kohno,et al.  The CWC Authenticated Encryption (Associated Data) Mode , 2003 .

[23]  Akashi Satoh,et al.  A 10 Gbps full-AES crypto design with a twisted-BDD S-Box architecture , 2002, Proceedings. IEEE International Conference on Computer Design: VLSI in Computers and Processors.