Latin squares and cryptography
Otokar Grošek (Slovak University of Technology)

Besides some historical notes we will discuss three cases in cryptography where Latin squares play a prominent role. The first is to formalize the notion of non-polynomial quasigroups, state some of their properties and provide their construction. The second is in construction of so called S-boxes satisfying some ideal properties. We showe that using quasigroups instead of groups allows more options to gain ideal parameters for some cryptographic primitives, and thus to prevent against differential and linear cryptanalysis. The last one is a design of key-dependent S-boxes based on Latin squares.