Some constructions of systematic authentication codes using Galois rings

DOI10.1007/S10623-006-9021-XMaRDI QIDQ2383975zbMATH OpenOpenAlexFDO

Authors Ferruh Özbudak, Zülfükar Saygı

Publication date 20 September 2007

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-006-9021-x

zbMATH Keywords

cryptography

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Review text

The authors look at authentication codes over finite fields by employing Galois rings. In the process they provide corrections to the estimates given in ``\(A\)-codes from rational functions over Galois rings [Des. Codes Cryptography 39, No. 2, 207--214 (2006; Zbl 1118.14030)]. Moreover, they provide generalizations of results in the literature.

Recommendations

• Authentication codes based on resilient Boolean maps
• Bent functions on a Galois ring and systematic authentication codes
• Linear authentication codes over finite local rings
• Systematic authentication codes using additive polynomials
• Construction and comparison of authentication codes

Cites work

• A metric for codes over residue class rings
• A-codes from rational functions over Galois rings
• An upper bound for Weil exponential sums over Galois rings and applications
• Coding and Cryptography
• Gray isometries for finite chain rings and a nonlinear ternary (36, 3/sup 12/, 15) code
• scientific article; zbMATH DE number 1024067 (Why is no real title available?)
• scientific article; zbMATH DE number 2002850 (Why is no real title available?)
• scientific article; zbMATH DE number 953216 (Why is no real title available?)
• scientific article; zbMATH DE number 774344 (Why is no real title available?)
• Systematic Authentication Codes From Highly Nonlinear Functions
• Universal hash functions from exponential sums over finite fields and Galois rings
• Universal hashing and authentication codes

Cited in

(9)

• Systematic authentication codes using additive polynomials
• New constructions of systematic authentication codes from three classes of cyclic codes
• Authentication codes based on resilient Boolean maps
• Gray images of constacyclic codes over Galois rings \(\mathcal{R}\) of nilpotency index 3
• Bent functions on a Galois ring and systematic authentication codes
• scientific article; zbMATH DE number 2170431 (Why is no real title available?)
• Linear authentication codes over finite local rings
• Generalized Cohn functions on Galois rings
• The Gauss sums over Galois rings and its absolute values

This page was built for publication: Some constructions of systematic authentication codes using Galois rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2383975)