Combinatorial characterizations of authentication codes
From MaRDI portal
Publication:1200311
DOI10.1007/BF00124896zbMath0755.05008OpenAlexW4234680107MaRDI QIDQ1200311
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
orthogonal arraysauthentication codesbalanced incomplete block designsencoding rulescombinatorial characterizations
Combinatorial aspects of block designs (05B05) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Orthogonal arrays, Latin squares, Room squares (05B15)
Related Items (18)
ON "THE POWER OF VERIFICATION QUERIES" IN UNCONDITIONALLY SECURE MESSAGE AUTHENTICATION ⋮ Universal hashing and authentication codes ⋮ AUTHENTICATION CODES FROM DIFFERENCE BALANCED FUNCTIONS ⋮ Authentication codes based on resilient Boolean maps ⋮ Difference covering arrays and pseudo-orthogonal Latin squares ⋮ Complete weight enumerator of torsion codes ⋮ Isomorphism classes of authentication codes ⋮ Combinatorial bounds and characterizations of splitting authentication codes ⋮ Logarithm Cartesian authentication codes. ⋮ Cartesian authentication codes from functions with optimal nonlinearity. ⋮ Local permutation polynomials and the action of e-Klenian groups ⋮ Authentication codes and bipartite graphs ⋮ A coding theory construction of new systematic authentication codes ⋮ Mutually orthogonal Latin squares based on cellular automata ⋮ Коды аутентификации с секретностью (обзор) ⋮ Invariant codes, difference schemes, and distributive quasigroups ⋮ On (\(g\), 4; 1)-difference matrices ⋮ Mutually unbiased maximally entangled bases from difference matrices
Cites Work
This page was built for publication: Combinatorial characterizations of authentication codes
