BentSign: keyed hash algorithm based on bent Boolean function and chaotic attractor
Todorova Mihaela , Borislav Stoyanov , Krzysztof Szczypiorski , Waldemar Graniszewski , Krasimir Kordov
AbstractIn this study, we propose a novel keyed hash algorithm based on a Boolean function and chaotic attractor. The hash algorithm called BentSign is based on two Signature attractors and XOR function and a bent Boolean function. The provided theoretical and experimental results confirm that the novel scheme can generate output hashes with a good level of security, collision resistance, and protection against most common attacks.
|Journal series||Bulletin of the Polish Academy of Sciences, Technical Sciences, [Bulletin of the Polish Academy of Sciences: Technical Sciences], ISSN 0239-7528, e-ISSN 2300-1917|
|Publication size in sheets||27.85|
|Keywords in English||hash algorithm, chaotic attractor, Bent Boolean function, pseudorandom bit generation scheme.|
|ASJC Classification||; ; ; ;|
|Score||= 100.0, 18-09-2020, ArticleFromJournal|
|Publication indicators||= 2.0; = 1; : 2018 = 1.293; : 2018 = 1.277 (2) - 2018=1.256 (5)|
|Citation count*||2 (2020-09-21)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.