BentSign: Keyed hash algorithm based on bent Boolean function and chaotic attractor

8Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

In 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.

Cite

CITATION STYLE

APA

Todorova, M., Stoyanov, B., Szczypiorski, K., Graniszewski, W., & Kordov, K. (2019). BentSign: Keyed hash algorithm based on bent Boolean function and chaotic attractor. Bulletin of the Polish Academy of Sciences: Technical Sciences, 67(3), 557–569. https://doi.org/10.24425/bpasts.2019.129654

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free