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. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Snášel, V., Dvorský, J., Ochodková, E., Krömer, P., Platoš, J., & Abraham, A. (2010). Genetic algorithms evolving quasigroups with good pseudorandom properties. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6018 LNCS, pp. 472–482). Springer Verlag. https://doi.org/10.1007/978-3-642-12179-1_39
Mendeley helps you to discover research relevant for your work.