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

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 normal form of idempotent matrices over finite fields(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? the probabilities of a successful substitution by the opponent? the probabilities of a successful impersonation by the transmitter? the probabilities of a successful impersonation by the receiver? the probabilities of a successful substitution by the receiver...