Construction of authentication codes based on orthogonal array and Latin square
DOI10.1007/S40314-022-01866-7zbMath1499.94058OpenAlexW4225276571MaRDI QIDQ2140799
Ni Jin, Miao Cao, Yuming Wen, Xiuli Wang
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
Latin squareorthogonal arraysplitting authentication codeCartesian authentication codedistribution probability
Cryptography (94A60) Orthogonal arrays, Latin squares, Room squares (05B15) Applications of design theory to circuits and networks (94C30) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Unnamed Item
- Unnamed Item
- The combinatorics of authentication and secrecy codes
- Construction of Cartesian authentication codes from unitary geometry
- A construction for optimal \(c\)-splitting authentication and secrecy codes
- Error-correcting codes for authentication and subliminal channels
- Communication Theory of Secrecy Systems*
- Authentication Theory/Coding Theory
- Codes Which Detect Deception
- Message Authentication with Arbitration of Transmitter/Receiver Disputes
This page was built for publication: Construction of authentication codes based on orthogonal array and Latin square