Logarithm Cartesian authentication codes.

DOI10.1016/S0890-5401(03)00053-1MaRDI QIDQ1398375zbMATH OpenOpenAlexFDO

Authors Tsz-Wo Sze, Cunsheng Ding, Samuel T. Chanson, Tor Helleseth, Matthew G. Parker

Publication date 29 July 2003

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0890-5401(03)00053-1

zbMATH Keywords

authentication codesCartesian codescyclotomy

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Review text

The paper considers logarithm Cartesian authentication codes. It extends work by \textit{S. Chanson, C. Ding} and \textit{A. Salomaa} [Theor. Comput. Sci. 290, 1737--1752 (2003; Zbl 1044.68050)], who have provided several classes of authentication codes constructed from certain classes of functions. The paper at hand uses this framework to construct codes from logarithm functions. The codes obtained are better then a subclass of Helleseth-Johansson's codes and Bierbrauer's codes in terms of the success probability of the substitution attack.

Recommendations

• scientific article; zbMATH DE number 5943313
• scientific article; zbMATH DE number 16480
• A Generic Construction of Cartesian Authentication Codes
• Authentication codes and combinatorial designs.
• Cartesian authentication codes from functions with optimal nonlinearity.
• A password authentication scheme based on discrete logarithms
• scientific article; zbMATH DE number 1440053
• scientific article; zbMATH DE number 1944666
• A logic of authentication
• A new key authentication scheme based on discrete logarithms

Cites work

• Cartesian authentication codes from functions with optimal nonlinearity.
• Codes Which Detect Deception
• Combinatorial characterizations of authentication codes
• Combinatorial characterizations of authentication codes. II
• Constructions of authentication codes from algebraic curves over finite fields
• scientific article; zbMATH DE number 1196713 (Why is no real title available?)
• scientific article; zbMATH DE number 1303147 (Why is no real title available?)
• scientific article; zbMATH DE number 1500491 (Why is no real title available?)
• Multireceiver authentication codes: Models, bounds, constructions, and extensions
• New hash functions and their use in authentication and set equality
• Universal hashing and geometric codes

Cited in

(6)

• Cartesian authentication codes from functions with optimal nonlinearity.
• New methods of construction of Cartesian authentication codes from geometries over finite commutative rings
• Highly nonlinear mappings
• Two new classes of binary sequence pairs with three-level cross-correlation
• scientific article; zbMATH DE number 16480 (Why is no real title available?)
• Constructions of external difference families and disjoint difference families

This page was built for publication: Logarithm Cartesian authentication codes.

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