TY - GEN
A1 - Kościelny, Czesław
A2 - Korbicz, Józef - red.
A2 - Uciński, Dariusz - red.
PB - Zielona Góra: Uniwersytet Zielonogórski
N2 - 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.
N2 - 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 order 256, suitable for a fast software encryption of messages written down in the universal ASCII code.
N2 - That is exactly what this paper provides: fast and easy ways of generating quasigroups of order up to 256 and a little more.
L1 - http://www.zbc.uz.zgora.pl/Content/58961/AMCS_2002_12_4_11.pdf
L2 - http://www.zbc.uz.zgora.pl/Content/58961
KW - quasigroups
KW - latin squares
KW - stream-ciphers
KW - cryptography
T1 - Generating quasigroups for cryptographic applications
UR - http://www.zbc.uz.zgora.pl/dlibra/docmetadata?id=58961
ER -