A new authentication scheme based on latin squares
Discrete Mathematics - A collection of contributions in honour of Jack van Lint
An introduction to genetic algorithms
An introduction to genetic algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Genetic programming: a paradigm for genetically breeding populations of computer programs to solve problems
Secrecy, authentication, and public key systems.
Secrecy, authentication, and public key systems.
CISIM '08 Proceedings of the 2008 7th Computer Information Systems and Industrial Management Applications
New Stream Cipher Designs
Hash Functions Based on Large Quasigroups
ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
Evolutionary computation: comments on the history and current state
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.00 |
Quasigroups are a well-known combinatorial design equivalent to more familiar Latin squares. Because all possible elements of a quasigroup occur with equal probability, it makes it an interesting tool for the application in computer security and for production of pseudorandom sequences. Prior implementations of quasigroups were based on look-up table of the quasigroup, on system of distinct representatives etc. Such representations are infeasible for large quasigroups. In contrast, presented analytic quasigroup can be implemented easily. It allows the generation of pseudorandom sequences without storing large amount of data (look-up table). The concept of isotopy enables consideration of many quasigroups and genetic algorithms allow efficient search for good ones.