Dénes J., Dénes T.
Non-associative algebraic system in cryptology. Protection against "meet in the middle" attack

In this paper we shall mention an algorithm of zero knowledge proof based on Latin squares. We shall define the DL_m(n) type Latin squares, which have a further property that is stronger than the pan-Hamiltonian squares: Every pair of DL_m(n) rows and columns is a cycle of length n, if n is prime.