| Using Normal Form of Matrices over Finite Fields to Construct Cartesian Authentication Codes |
| Received:October 04, 1995 |
| Key Words:
cartesian authentication codes finite field normal form of matrices.
|
| Fund Project:This preject is supported by Heilongjiang Natural Science Foundation. |
|
| Hits: 2321 |
| Download times: 1982 |
| Abstract: |
| In this paper, one construction of Cartesian authentication codes from the normal form of matrices over finite fields are presented and its size parameters are computed. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the PI and PS, which denote the largest probabilities of a successful impersonation attack and of a successful substitution attack respectively, of these codes are also computed. |
| Citation: |
| DOI:10.3770/j.issn:1000-341X.1998.03.005 |
| View Full Text View/Add Comment |
