Algebraic and Combinatorial Characterization of Latin squares I
József Dénes (1967)
Matematický časopis
Similarity:
Displaying similar documents to “Latin squars, -Quasigroups and graph decompositions”
Algebraic and Combinatorial Characterization of Latin squares I
Generating quasigroups for cryptographic applications
Czesław Kościelny (2002)
International Journal of Applied Mathematics and Computer Science
Similarity:
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...
The many formulae for the number of Latin rectangles.
Stones, Douglas S. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Parastrophically Equivalent Quasigroup Equations
Aleksandar Krapež, Dejan Živković (2010)
Publications de l'Institut Mathématique
Similarity:
Infinitary Quasigroups
Belousov D. Valentin, Stojaković M. Zoran (1976)
Zbornik Radova
Similarity:
On multiplication groups of relatively free quasigroups isotopic to Abelian groups
Aleš Drápal (2005)
Czechoslovak Mathematical Journal
Similarity:
If is a quasigroup that is free in the class of all quasigroups which are isotopic to an Abelian group, then its multiplication group is a Frobenius group. Conversely, if is a Frobenius group, a quasigroup, then has to be isotopic to an Abelian group. If is, in addition, finite, then it must be a central quasigroup (a -quasigroup).