Construction of Cartesian authentication codes over unitary spaces

摘要

A construction of Cartesian authentication codes over unitary spaces is presented and its size parameters are computed. Assuming the encoding rules are chosen according to a uniform probability distribution, the probabilities of success for different types of attacks are also computed.