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

orthogonal arraysauthentication codesbalanced incomplete block designsencoding rulescombinatorial characterizations

Mathematics Subject Classification ID

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

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

• 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?)
• Authentication Theory/Coding Theory
• New bounds and constructions for authentication/secrecy codes with splitting
• The combinatorics of authentication and secrecy codes

Cited in

(25)

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

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)