Resolvable Designs Applicable to Cryptographic Authentication Schemes

We consider certain resolvable designs which have applications to doubly perfect Cartesian authentication schemes. These generalize structures determined by sets of mutually orthogonal Latin squares and are related to semi-Latin squares and other designs which find applications in the design of experiments.