Testing Quasigroup Identities using Product of Sequence

Non-associative quasigroups are well known combinatorial designs with many different applications. Many cryptographic algorithms based on quasigroups primitives have been published. There are several classifications of quasigroups based on their algebraic properties. In this paper we propose a new classification of quasigroups based upon strings (product elements) obtained by a product of a sequence. It is shown in this paper that the more various results of the product elements, the less associative quasigroup.

• Type: Journal
• Year: 2010
• Where: DATESO
• Authors: Eliska Ochodkova, Jiri Dvorský, Václav Snásel, Ajith Abraham
• Keywords: Database, DATESO 2010, Many Cryptographic Algorithms, Product Elements, Quasigroup