Generation of Quasigroup for Cryptographic Application

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 cipher text. Moreover, it can be used for varied information viz. text, image, etc. Many of the on going algorithms uses NLFSR to generate pseudo random sequence and thus the suggested method can be integrated in any of the existing pseudo random sequence to further enhance their complexity. The implementation of PRSG using quasi group processing is highly scalable and fairly unpredictable. It has passed all publicly available random sequence generator tests. That is exactly what this paper provides: fast and easy ways of generating quasigroups of order up to 256 and a little more.