Generalizations of partial difference sets from cyclotomy to nonelementary Abelian -groups.
Generalized Weisner designs and quasigroups.
Generating quasigroups for cryptographic applications
A method of generating a practically unlimited number of quasigroups of a (theoretically) arbitrary order using the computer algebra system Maple 7 is presented. This problem is crucial to cryptography and its solution permits to implement practical quasigroup-based endomorphic cryptosystems. The order of a quasigroup usually equals the number of characters of the alphabet used for recording both the plaintext and the ciphertext. From the practical viewpoint, the most important quasigroups are of...
Graphs associated with codes of covering radius 1 and minimum distance 2.
Group actions on magic squares.
Group distances of Latin squares
Groupoids and the associative law. VII. Semigroup distance of SH-groupoids