Name
Abstract | ||
|---|---|---|
With the growing importance of data security a growing effort to find new approaches to the cryptographic algorithms designs appears. One of the trends is to research the use of other algebraic structures than the traditional, such as a quasigroup. Quasigroups are equivalent to the more familiar Latin squares. There are many characteristics that must quasigroups have from the cryptography point of view. They have to be non-commutative, non-associative, non-idempotent and so on. If one want to work with quasigroups of a large order, effective methods of testing their properties are necessary. In this paper we present several experiments on various types of guasigroups and their results. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/ICUMT.2009.5345507 | St. Petersburg |
Keywords | Field | DocType |
algebra,cryptography,Latin square,algebraic structure,cryptographic algorithms design,data security,large quasigroups property,Cryptography,Hamming distance,Quasigroup,Slot distiribution | Data security,Algebraic structure,Computer science,Cryptography,Theoretical computer science,Construction industry,Hamming distance,Quasigroup | Conference |
ISBN | Citations | PageRank |
978-1-4244-3941-6 | 3 | 0.54 |
References | Authors | |
3 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eliška Ochodková | 1 | 30 | 7.54 |
| Jiří Dvorský | 2 | 64 | 17.43 |
| Václav Snasel | 3 | 1261 | 210.53 |
| Ajith Abraham | 4 | 8954 | 729.23 |