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 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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-12179-1_39 | ICCSA (3) |
Keywords | Field | DocType |
familiar latin square,equal probability,pseudorandom sequence,genetic algorithm,efficient search,computer security,look-up table,large amount,good pseudorandom property,distinct representative,large quasigroups,analytic quasigroup,random sequence,look up table,combinatorial design,latin square | Lookup table,Mathematical optimization,Computer science,Algorithm,Theoretical computer science,Stream cipher,Combinatorial design,Hash function,Isotopy,Quasigroup,Genetic algorithm,Pseudorandom number generator | Conference |
Volume | ISSN | ISBN |
6018 | 0302-9743 | 3-642-12178-0 |
Citations | PageRank | References |
3 | 0.45 | 7 |
Authors | ||
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 Platoš | 5 | 51 | 7.89 |
| Ajith Abraham | 6 | 8954 | 729.23 |