Searching for quasigroups for hash functions with genetic algorithms

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F09%3A00020947" target="_blank" >RIV/61989100:27240/09:00020947 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Searching for quasigroups for hash functions with genetic algorithms
Original language description
In this study we discuss a method for evolution of quasigroups with desired properties based on genetic algorithms. Quasigroups are a well-known combinatorial design equivalent to the more familiar Latin squares. One of their most important properties isthat all possible elements of certain quasigroup occur with equal probability. The quasigroups are evolved within a framework of a simple hash function. Prior implementations of quasigroups were based on look-up table of the quasigroup, which is infeasible for large quasigroups. In contrast, analytic quasigroup can be implemented easily. It allows the evaluation of hash function without storing large amount of data (look-up table) and the concept of homotopy enables consideration of many quasigropus.
Czech name
—
Czech description
—

Project
<a href="/en/project/GA102%2F09%2F1494" target="_blank" >GA102/09/1494: New methods od data transmition based on turbo code</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
World Congress on Nature & Biologically Inspired Computing, 2009. NaBIC 2009
ISBN
978-1-4244-5053-4
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
—
Publisher name
IEEE Computer Society
Place of publication
Los Alamitos, California
Event location
Coimbatore, India
Event date
Dec 9, 2009
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)