Combinatorial characterizations of authentication codes

DOI10.1007/BF00124896MaRDI QIDQ1200311zbMATH OpenOpenAlexFDO

Authors D. R. Stinson

Publication date 16 January 1993

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

Full work available at URL https://doi.org/10.1007/bf00124896

zbMATH Keywords

authentication codesbalanced incomplete block designscombinatorial characterizationsencoding rulesorthogonal arrays

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 176540
• Authentication codes and bipartite graphs
• Combinatorial characterizations of authentication codes. II
• Some constructions and bounds for authentication codes
• The combinatorics of authentication and secrecy codes

Cites work

• Authentication Theory/Coding Theory
• scientific article; zbMATH DE number 4045632 (Why is no real title available?)
• scientific article; zbMATH DE number 4070794 (Why is no real title available?)
• scientific article; zbMATH DE number 16480 (Why is no real title available?)
• scientific article; zbMATH DE number 3893245 (Why is no real title available?)
• scientific article; zbMATH DE number 3895109 (Why is no real title available?)
• New bounds and constructions for authentication/secrecy codes with splitting
• The combinatorics of authentication and secrecy codes

Cited in

(27)

• Universal hashing and authentication codes
• Logarithm Cartesian authentication codes.
• Cartesian authentication codes from functions with optimal nonlinearity.
• Combinatorial classification of optimal authentication codes with arbitration
• A coding theory construction of new systematic authentication codes
• Combinatorial characterizations of authentication codes. II
• Invariant codes, difference schemes, and distributive quasigroups
• Complete weight enumerator of torsion codes
• Mutually orthogonal Latin squares based on cellular automata
• On (\(g\), 4; 1)-difference matrices
• Authentication codes based on resilient Boolean maps
• Difference covering arrays and pseudo-orthogonal Latin squares
• Combinatorial characterisation of -optimal authentication codes with arbitration
• On ``the power of verification queries in unconditionally secure message authentication
• Authentication codes from difference balanced functions
• Коды аутентификации с секретностью (обзор)
• scientific article; zbMATH DE number 176540 (Why is no real title available?)
• scientific article; zbMATH DE number 1024097 (Why is no real title available?)
• Isomorphism classes of authentication codes
• Combinatorial Constructions for Optimal Splitting Authentication Codes
• Mutually unbiased maximally entangled bases from difference matrices
• Combinatorial bounds and characterizations of splitting authentication codes
• Local permutation polynomials and the action of e-Klenian groups
• Local permutation polynomials and their companions
• Difference packing arrays and systematic authentication codes
• The combinatorics of authentication and secrecy codes
• Authentication codes and bipartite graphs

This page was built for publication: Combinatorial characterizations of authentication codes

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