Abstract. In t#liis 1)apcr ncw families of stmngly universal hash funct,ions, or equivalently, authentication codes, are proposed. Their parameters are derived from bounds on exponential sums over finite fields and Galois rings. This is the first tirnr hash families based upon such exponential sums have 1)een considered. Thi>ir performance improves the previously best known c.oiist,ructions and they rail be made general in their choice of parameters. Furthermore, the constructions are suitable both for hardware and software irri~~leniciitations. Tht. latter is an aspect that is significant. and has been considered iii several recent papers.