Loading...
Please wait, while we are loading the content...
Similar Documents
Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings
| Content Provider | Semantic Scholar |
|---|---|
| Author | Hellcscth, Tor |
| Copyright Year | 1996 |
| Abstract | In t#liis 1)apcr ncw families of stmngly universal hash func- t,ions, or equivalently, authentication codes, are proposed. Their param- eters are derived from bounds on exponential sums over finite fields and Galois rings. This is the first tirnr hash families based upon such ex- ponential 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. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://cr.yp.to/bib/1996/helleseth.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |