Generating quasigroups for cryptographic applications
International Journal of Applied Mathematics and Computer Science, Tome 12 (2002) no. 4, pp. 559-569
Voir la notice de l'article provenant de la source Library of Science
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 order 256, suitable for a fast software encryption of messages written down in the universal ASCII code. That is exactly what this paper provides: fast and easy ways of generating quasigroups of order up to 256 and a little more.
Keywords:
quasigroups, latin squares, stream ciphers, cryptography
Mots-clés : informatyka
Mots-clés : informatyka
@article{IJAMCS_2002_12_4_a10,
author = {Ko\'scielny, Cz.},
title = {Generating quasigroups for cryptographic applications},
journal = {International Journal of Applied Mathematics and Computer Science},
pages = {559--569},
publisher = {mathdoc},
volume = {12},
number = {4},
year = {2002},
language = {en},
url = {http://geodesic.mathdoc.fr/item/IJAMCS_2002_12_4_a10/}
}
TY - JOUR AU - Kościelny, Cz. TI - Generating quasigroups for cryptographic applications JO - International Journal of Applied Mathematics and Computer Science PY - 2002 SP - 559 EP - 569 VL - 12 IS - 4 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/IJAMCS_2002_12_4_a10/ LA - en ID - IJAMCS_2002_12_4_a10 ER -
Kościelny, Cz. Generating quasigroups for cryptographic applications. International Journal of Applied Mathematics and Computer Science, Tome 12 (2002) no. 4, pp. 559-569. http://geodesic.mathdoc.fr/item/IJAMCS_2002_12_4_a10/