Using Normal Form Of Skew Matrices Over Finite Fields To Construct Cartesian Authentication Codes With Arbitration

Unconditionally secure authentication codes with arbitration protects against deceptionsfrom the transmitter and receives as well as those from the opponent.This article describesa construction of authentication codes with arbitration from skew matrices over finitefields(char≠2).And according to a uniform probability distribution their size parameters are computed.We have results as follows:·The probabilities of a successful impersonation by the opponent is·The probabilities of a successful substitution by the opponent is·The probabilities of a successful impersonation by the transmitter is·The probabilities of a successful impersonation by the receiver is·The probabilities of a successful substitution by the receiver is...