zbMATH — the first resource for mathematics

On authentication codes based on orthogonal tables. (Russian. English summary) Zbl 1413.94051
Summary: The authentication codes resistant to messages imitation and substitution are investigated. The case when the probabilities of imitation and substitution reach the lower limits has been highlighted. Such authentication codes are called optimal. We study constructions of optimal authentication codes based on orthogonal tables. The case of optimal authentication codes with optional uniform distribution on the set of keys is studied.
94A60 Cryptography
94A62 Authentication, digital signatures and secret sharing
Full Text: DOI MNR
[1] [1] Cheremushkin A. V., Kriptograficheskie protokoly. Osnovnye svoistva i uiazvimosti [Cryptographic Protocols: Basic Properties and Vulnerability], Akademiia, Moscow, 2009, 272 pp. (In Russian)
[2] [2] Holl M., Combinatorial Theory, John Wiley & Sons, Inc., New York, 1988, xvii+440 pp.
[3] [3] Bose R. S., “On the applications of the properties of Galois fields to the problems of construction of Hyper–Graeco–Latin square”, Indian J. Stat, 4:3 (1938), 323–338
[4] [4] Ratseev S. M., “On optimal authentication code”, Sistemy i Sredstva Inform., 23:1 (2013), 53–57 (In Russian)
[5] [5] Zubov A. Iy., Kriptograficheskie metody zashchity informatsii. Sovershennye shifry [Cryptographic Metho ds of Information Security. Perfect Ciphers], Gelios ARV, Moscow, 2005, 192 pp. (In Russian)
[6] [6] Ratseev S. M., “About perfect imitation resistant ciphers”, Prikl. Diskr. Mat., 2012, no. 3, 41–46 (In Russian) · Zbl 1430.94085
[7] [7] Ratseev S. M., “On perfect imitation resistant ciphers of substitution with unbounded key”, Vestnik SamGU. Estestvenno-Nauchnaya Ser., 2013, no. 9/1(110), 42–48 (In Russian) · Zbl 1322.94092
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.