Abstract
This work presents a new method to compute the GHASH function involved in the Galois/Counter Mode of operation for block ciphers. If X = X 1 ...X n is a bit string made of n blocks of 128 bits each, then the GHASH function effectively computes \(X_1H^n + X_2H^{n-1} + \ldots X_nH\), where H is an element of the binary field \({\mathbb{F}}_{2^{128}}\). This operation is usually computed by using n successive multiply-add operations over \({\mathbb{F}}_{2^{128}}\). In this work, we propose a method to replace all but a fixed number of those multiplications by additions on the field. This is achieved by using the characteristic polynomial of H. We present both how to use this polynomial to speed up the GHASH function and how to efficiently compute it for each session that uses a new H.
Chapter PDF
Similar content being viewed by others
References
Bajard, J.-C., Imbert, L., Jullien, G.A.: Parallel Montgomery multiplication in GF(2k) using trinomial residue arithmetic. In: Proc. 17th IEEE Symposium on Computer Arithmetic (ARITH), pp. 164–171 (2005)
Bulens, P., Standaert, F.-X., Quisquater, J.-J., Pellegrin, P., Rouvroy, G.: Implementation of the AES-128 on virtex-5 FPGAs. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol. 5023, pp. 16–26. Springer, Heidelberg (2008)
Fan, H., Hasan, M.A.: A new approach to subquadratic space complexity parallel multipliers for extended binary fields. IEEE Transactions on Computers 56(2), 224–233 (2007)
Good, T., Benaissa, M.: AES on FPGA from the fastest to the smallest. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 427–440. Springer, Heidelberg (2005)
Gordon, J.A.: Very simple method to find the minimum polynomial of an arbitrary nonzero element of a finite field. Electronics Letters 12(25), 663–664 (1976)
Jarvinen, K.U., Tommiska, M.T., Skyttae, J.O.: A fully pipelined memoryless 17.8 Gbps AES-128 encryptor. In: International symposium on Field programmable gate arrays - FPGA, pp. 207–215. ACM, New York (2003)
Lemsitzer, S., Wolkerstorfer, J., Felber, N., Braendli, M.: Multi-gigabit GCM-AES architecture optimized for FPGAs. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol. 4727, pp. 227–238. Springer, Heidelberg (2007)
Mastrovito, E.D.: VLSI Architectures for Computation in Galois Fields. PhD thesis, Dept. of Electrical Eng., Link ping Univ., Sweden (1991)
McGrew, D.A., Viega, J.: The Galois/Counter Mode of Operation (GCM) (2005)
NIST. Recommendation for Block Cipher Modes of Operation: Galois/Counter Mode (GCM) and GMAC (November 2007)
Paar, C.: A new architecture for a parallel finite field multiplier with low complexity based on composite fields. IEEE Transactions on Computers 45(7), 856–861 (1996)
Patel, P.: Parallel multiplier designs for the Galois/counter mode of operation. Master’s thesis, Electrical and Computer Engineering, University of Waterloo (2008)
Satoh, A.: High-speed hardware architectures for authenticated encryption mode gcm. In: IEEE International Symposium on Circuits and Systems - ISCAS, pp. 4831–4834 (2006)
Satoh, A.: High-speed parallel hardware architecture for Galois counter mode. In: IEEE International Symposium on Circuits and Systems - ISCAS, pp. 1863–1866 (2007)
Satoh, A., Sugawara, T., Aoki, T.: High-speed pipelined hardware architecture for Galois counter mode. In: Garay, J.A., Lenstra, A.K., Mambo, M., Peralta, R. (eds.) ISC 2007. LNCS, vol. 4779, pp. 1863–1866. Springer, Heidelberg (2007)
Standaert, F.X., Rouvroy, G., Quisquater, J.-J., Legat, J.-D.: Efficient implementation of Rijndael encryption in reconfigurable hardware: Improvements and design tradeoffs. In: Walter, C.D., Koç, Ç.K., Paar, C. (eds.) CHES 2003. LNCS, vol. 2779, pp. 334–350. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Méloni, N., Négre, C., Hasan, M.A. (2010). High Performance GHASH Function for Long Messages. In: Zhou, J., Yung, M. (eds) Applied Cryptography and Network Security. ACNS 2010. Lecture Notes in Computer Science, vol 6123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13708-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-13708-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13707-5
Online ISBN: 978-3-642-13708-2
eBook Packages: Computer ScienceComputer Science (R0)