Publication Date


Date of Final Oral Examination (Defense)


Type of Culminating Activity


Degree Title

Master of Science in Mathematics



Major Advisor

Liljana Babinkostova, Ph.D.


Samuel Coskey, Ph.D.


Marion Scheepers, Ph.D.


Jyh-haw Yeh, Ph.D.


A latin square of order-n is an n x n array over a set of n symbols such that every symbol appears exactly once in each row and exactly once in each column. Latin squares encode features of algebraic structures. When an algebraic structure passes certain "latin square tests", it is a candidate for use in the construction of cryptographic systems. A transversal of a latin square is a list of n distinct symbols, one from each row and each column. The question regarding the existence of transversals in latin squares that encode the Cayley tables of finite groups is far from being resolved and is an area of active investigation. It is known that counting the pairs of permutations over a Galois field 𝔽pd whose point-wise sum is also a permutation is equivalent to counting the transversals of a latin square that encodes the addition group of 𝔽pd. We survey some recent results and conjectures pertaining to latin squares and transversals. We create software tools that generate latin squares and count their transversals. We confirm previous results that cyclic latin squares of prime order-p possess the maximum transversal counts for 3 ≤ p ≤ 9. Furthermore, we create a new algorithm that uses these prime order-p cyclic latin squares as "building blocks" to construct super-symmetric latin squares of prime power order-pd with d > 0; using this algorithm we accurately predict that super-symmetric latin squares of order-pd possess the confirmed maximum transversal counts for 3 ≤ pd ≤ 9 and the estimated lower bound on the maximum transversal counts for 9 < pd ≤ 17. Also, we give some conjectures regarding the number of transversals in a super-symmetric latin square. Lastly, we use the super-symmetric latin square for the additive group of the Galois field (𝔽32, +) to create a simplified version of Grøstl, an iterated hash function, where the compression function is built from two fixed, large, distinct permutations.


The latest versions of our latin square software tools are open source and are available at: