Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings
From MaRDI portal
Publication:3452337
DOI10.1007/3-540-68697-5_3zbMath1329.94062OpenAlexW1559979410MaRDI QIDQ3452337
Tor Helleseth, Thomas Johansson
Publication date: 11 November 2015
Published in: Advances in Cryptology — CRYPTO ’96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-68697-5_3
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Exponential sums (11T23) Authentication, digital signatures and secret sharing (94A62)
Related Items (10)
Universal Hashing and Multiple Authentication ⋮ Some constructions of systematic authentication codes using Galois rings ⋮ Authentication schemes from highly nonlinear functions ⋮ Cartesian authentication codes from functions with optimal nonlinearity. ⋮ MMH: Software message authentication in the Gbit/second rates ⋮ A coding theory construction of new systematic authentication codes ⋮ New constructions of systematic authentication codes from three classes of cyclic codes ⋮ Systematic authentication codes using additive polynomials ⋮ Коды аутентификации с секретностью (обзор) ⋮ Normal bases on Galois ring extensions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the covering radius of cyclic linear codes and arithmetic codes
- New hash functions and their use in authentication and set equality
- Universal hashing and authentication codes
- Kerdock code in a cyclic form
- Authentication Theory/Coding Theory
- 4-phase sequences with near-optimum correlation properties
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Codes Which Detect Deception
- An upper bound for Weil exponential sums over Galois rings and applications
- On the cardinality of systematic authentication codes via error-correcting codes
- Bounds for exponential sums
This page was built for publication: Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings
