Abstract | ||
---|---|---|
In the last few years, quasigroups are finding their way to becoming a building block of cryptographic primitives. This paper extends previous work done on evolutionary search for quasigroups by defining fitness functions based on heterogeneous sequences generated during the exponentiation of quasigroups elements. In this paper, we explore how succeed a genetic algorithm in search for maximum of the best fitness function and some statistics about this fitness function is presented, too. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1007/978-3-642-33018-6_14 | INTERNATIONAL JOINT CONFERENCE CISIS'12 - ICEUTE'12 - SOCO'12 SPECIAL SESSIONS |
Keywords | Field | DocType |
Quasigroups,Genetic algorithms,Fitness function,Evolutionary search | Computer science,Cryptographic primitive,Fitness function,Theoretical computer science,Exponentiation,Genetic algorithm | Conference |
Volume | ISSN | Citations |
189 | 2194-5357 | 0 |
PageRank | References | Authors |
0.34 | 5 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Eliška Ochodková | 1 | 30 | 7.54 |
Jiří Dvorský | 2 | 64 | 17.43 |
Krömer Pavel | 3 | 330 | 59.99 |
Pavel Tucek | 4 | 3 | 2.92 |