scientific article; zbMATH DE number 109201
The present authors suggest authentication schemes based on resolvable designs. The designs can be constructed with the aid of orthogonal latin squares and semi-latin squares. Reviewer's remarks: (1) The reader might be interested to known that \textit{William W. Wu} in his book [Elements of digital satellite communication: Channel Coding and Integrated Services Digital Satellite Networks Vol. 2. Computer Science Press (1985)] suggested a very similar scheme for non-Aloha multiple access. (2) Perhaps it would have been worth to mention by the present authors that in a recent joint paper by the reviewer and \textit{A. D. Keedwell} [A new authentication scheme based on latin squares, Discrete Math. 106/107, 157--161 (1992; Zbl 0755.94006)] an authentication scheme based on latin squares, different from the present one, has been described. The comparison of the parameters would be helpful for the interested reader.
- A new authentication scheme based on latin squares
- Multi-part balanced incomplete-block designs
- A message authentication code based on Latin squares
- scientific article; zbMATH DE number 975409 (Why is no real title available?)
- New bound for affine resolvable designs and its application to authentication codes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4024337)