Construction of authentication codes based on orthogonal array and Latin square

DOI10.1007/S40314-022-01866-7MaRDI QIDQ2140799zbMATH OpenOpenAlexFDO

Authors Xiuli Wang, Ni Jin, Miao Cao, Yuming Wen

Publication date 23 May 2022

Published in Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40314-022-01866-7

zbMATH Keywords

Cartesian authentication codedistribution probabilityLatin squareorthogonal arraysplitting authentication code

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Applications of design theory to circuits and networks (94C30)

Cites work

• A construction for optimal \(c\)-splitting authentication and secrecy codes
• Authentication codes and combinatorial designs.
• Authentication Theory/Coding Theory
• Codes Which Detect Deception
• Communication Theory of Secrecy Systems*
• Construction of Cartesian authentication codes from unitary geometry
• Design theory
• Error-correcting codes for authentication and subliminal channels
• Message authentication with arbitration of transmitter/receiver disputes
• The combinatorics of authentication and secrecy codes

Cited in

(5)

• Authentication perpendicular arrays APA1(2, 7, ?)
• scientific article; zbMATH DE number 1228786 (Why is no real title available?)
• scientific article; zbMATH DE number 2100047 (Why is no real title available?)
• Construction of asymmetric orthogonal arrays with high strength
• Construction of an optimal (k,n) multi-receiver authentication code based on orthogonal arrays

This page was built for publication: Construction of authentication codes based on orthogonal array and Latin square

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