A new authentication scheme based on latin squares

Abstract We propose a simple and flexible authentication scheme applicable for use with both binary and nonbinary messages and we show that, among the set of all possible messages of assigned length, all possible signatures occur with equal probability: that is, equally often. Additionally, our scheme allows calculation of the digits of the signature to be carried out in parallel.