Name
Abstract | ||
|---|---|---|
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 pseudo-random sequences. Most implementations of quasigroups are based on look-up table of the quasigroup, on system of distinct representatives etc. Such representations are infeasible for large quasigroups. An analytic quasigroup is a recent concept that allows usage of certain quasigroups without the need of look-up table. The concept of isotopy enables consideration of many quasigroups and genetic algorithms allow efficient search for good ones. In this paper we describe analytic quasigroup and genetic algorithms for its optimization. |
Year | Venue | Keywords |
|---|---|---|
2010 | CEUR Workshop Proceedings-Series | genetic algorithm |
Field | DocType | Volume |
Computer science,Theoretical computer science,Genetic representation,Combinatorial design,Isotopy,Quasigroup,Genetic algorithm,Pseudorandom number generator | Conference | 567 |
ISSN | Citations | PageRank |
1613-0073 | 4 | 0.50 |
References | Authors | |
5 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Václav Snasel | 1 | 1261 | 210.53 |
| Jiří Dvorský | 2 | 64 | 17.43 |
| Eliška Ochodková | 3 | 30 | 7.54 |
| Krömer Pavel | 4 | 330 | 59.99 |
| Jan Platos | 5 | 286 | 58.72 |
| Ajith Abraham | 6 | 8954 | 729.23 |