Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: cryptography

Sortuj według:

Ogranicz wyniki do:

Generating quasigroups for cryptographic applications

100%

Kościelny C.

International Journal of Applied Mathematics and Computer Science

2002

tom 12

nr 4

559-569

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.

Ograniczanie wyników

1 International Journal of Applied Mathematics and Computer Science

1 Kościelny C.

1 2002

Wyniki wyszukiwania

Generating quasigroups for cryptographic applications