DocumentCode
3634182
Title
Testing the properties of large quasigroups
Author
Eliska Ochodková;Jiří Dvorský;Václav Snášel;Ajith Abraham
Author_Institution
Department of Computer Science, Technical University of Ostrava, 17. listopadu 15, Poruba, Czech Republic
fYear
2009
Firstpage
1
Lastpage
7
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.
Keywords
"Testing","Public key cryptography","Computer science","Data security","Algorithm design and analysis","Hamming distance","Public key","Field programmable gate arrays","Table lookup","NIST"
Publisher
ieee
Conference_Titel
Ultra Modern Telecommunications & Workshops, 2009. ICUMT ´09. International Conference on
ISSN
2157-0221
Print_ISBN
978-1-4244-3942-3
Electronic_ISBN
2157-023X
Type
conf
DOI
10.1109/ICUMT.2009.5345507
Filename
5345507
Link To Document