|
Computer Science
On authentication codes based on orthogonal tables
S. M. Ratseeva, O. I. Cherevatenkob a Ulyanovsk State University, Ulyanovsk, 432017, Russian Federation
b Ulyanovsk State I. N. Ulyanov Pedagogical University, Ulyanovsk, 432063, Russian Federation
(published under the terms of the Creative Commons Attribution 4.0 International License)
Abstract:
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.
Keywords:
authentication code, message imitation, hash function.
Original article submitted 31/III/2014 revision submitted – 17/VI/2014
Citation:
S. M. Ratseev, O. I. Cherevatenko, “On authentication codes based on orthogonal tables”, Vestn. Samar. Gos. Tekhn. Univ., Ser. Fiz.-Mat. Nauki [J. Samara State Tech. Univ., Ser. Phys. Math. Sci.], 4(37) (2014), 178–186
Linking options:
https://www.mathnet.ru/eng/vsgtu1309 https://www.mathnet.ru/eng/vsgtu/v137/p178
|
Statistics & downloads: |
Abstract page: | 344 | Full-text PDF : | 170 | References: | 47 |
|