Hash Functions Based on Large Quasigroups

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F09%3A00020966" target="_blank" >RIV/61989100:27240/09:00020966 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Hash Functions Based on Large Quasigroups

Original language description

In this article we discuss a simple hash function based upon properties of a well-known combinatorial design called quasigroups. The quasigroups are equivalent to the more familiar Latin squares and one of their most important properties is that all possible element of certain quasigroup Occurs with equal probability. Actual implementations are based on look-LIP table implementation presneted of the quasigroup, which is unusable for large quasigroups. In contrast, hash function can be easily implemented. It allows Lis to compute hash function Without storing large amount of data (look-up table). The hash function computation is illustrated by experiments summarized in the last section of this paper.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

IN - Informatics

OECD FORD branch

—

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

COMPUTATIONAL SCIENCE - ICCS 2009

ISBN

978-3-642-01969-2

ISSN

—

e-ISSN

—

Number of pages

9

Pages from-to

—

Publisher name

Springer

Place of publication

Berlin/Heidelberg

Event location

Baton Rouge, LA, USA

Event date

May 25, 2009

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000267676600051