High Performance GHASH Function for Long Messages

摘要：

This work presents a new method to compute the GHASH function involved in the Galois/Counter Mode of operation for block ci phers. If X = X1 ... Xn is a bit string made of n blocks of 128 bits each, then the GHASH function effectively computes X1Hn +X2Hn-1 + ... XnH, where H is an element of the binary field F2128. This operation is usually computed by using n successive multiplyadd operations over F2128. In this work, we propose a method to replace all but a fixed num ber 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.

关键词： Galois/Counter mode GHASH function characteristic polynomial

作者: Nicolas Méloni Christophe Négre M. Anwar Hasan

作者单位: Department of Electrical and Computer Engineering University of Waterloo, Canada Team DALI/ELIAUS University of Perpignan, France

会议类型: 国际会议

会议名称: 8th International Conference,ACNS 2010(第八届国际应用密码与网络安全大会)

会议地点: 北京

会议语种:英文

页码: 154-167

在线出版日期: 2010-06-22（万方平台首次上网日期，不代表论文的发表时间）