Abstract
Abstract
In this paper, we construct some cartesian authentication codes from geometries over finite commutative rings. We only assume the uniform probability distribution over the set of encoding rules in order to be able to compute the probabilities of successful impersonation attack and substitution attack. Our methods are comfortable and secure for users, i.e., our encoding rules reduce the probabilities of successful impersonation attack and substitution attack.
Funder
King Mongkut’s University of Technology Thonburi
King Mongkut’s University of Technology North Bangkok
Subject
Applied Mathematics,Computational Mathematics,Computer Science Applications
Reference42 articles.
1. A construction of cartesian authentication code from orthogonal spaces over a finite field of odd characteristic;Discrete Math. Algorithms Appl.,2009
2. Logarithm Cartesian authentication codes;Inform. and Comput.,2003
3. Another construction of Cartesian authentication codes from geometry of classical groups;Northeast Math. J.,1999
4. Two constructions of Cartesian authentication codes from unitary geometry;Appl. Math. J. Chinese Univ. Ser. A,1996
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献