| An Algorithm of Building Fast Hash Functions Based on Replacement of Symbols |
|
 |
|
|
| Authors |
| | Reshetnikov A.V. |
| | Dyabin M.I. |
| Date of publication |
| | 2022 |
| DOI |
| | 10.31114/2078-7707-2022-4-26-31 |
|
| Abstract |
| | Given a formal language X. Let T be a mapping which replaces the symbols of X by non-negative integer numbers. For any sequence s = x1x2…xn of elements of X, suppose y0 = 0, yi = (yi–1 div 2) + T(xi) for all i. Let us define hSHR(s) = (yn mod 2M), where M is a positive integer number, say M = 8. So hSHR is an example of a function based on replacement of alphabetical symbols. M and T are the parameters of the function. If both parameters are chosen correctly, hSHR becomes very effective for hashing a given dictionary statically; an example is given in this paper. There are some other functions, based on replacement of symbols, which are also quite suitable for static hashing. The main problem is how to find an appropriate value for T. A possible solution is offered. The core idea is if it is possible to fix T in exactly one element in order to reduce the number of has collisions, this should be done; otherwise T should be randomized. |
| Keywords |
| | fast hash function, static hashing, replacement of alphabetic symbols |
| Library reference |
| | Reshetnikov A.V., Dyabin M.I. An Algorithm of Building Fast Hash Functions Based on Replacement of Symbols // Problems of Perspective Micro- and Nanoelectronic Systems Development - 2022. Issue 4. P. 26-31. doi:10.31114/2078-7707-2022-4-26-31 |
| URL of paper |
| | http://www.mes-conference.ru/data/year2022/pdf/D086.pdf |
