Unconditionally secure authentication codes with arbitration protects against deceptions from the transmitter and receives as well as those from the opponent. This article describes a construction of authentication codes with arbitration from orthogonal geometry over finite fields ( char≠2). And according to a uniform probability distribution then-size parameters are computed. We have results as follows:the probabilities of a successful impersonation by the opponentthe probabilities of a successful substitution by the opponentthe probabilities of a successful impersonation by the transmitterthe probabilities of a successful impersonation by the receiverthe probabilities of a successful substitution by the receiver...
|