Deakin University
Browse

File(s) under embargo

A chaos-based keyed hash function based on fixed point representation

journal contribution
posted on 2023-11-06, 03:43 authored by JS Teh, K Tan, M Alawida
Chaotic maps are used in the design of hash functions due to their characteristics that are analogous to cryptographic requirements. However, these maps are commonly implemented using floating point representation which has high computational complexity. They also suffer from interoperability problems and are not easy to analyse from the binary point of view. These drawbacks lead to a lack of acceptance of chaos-based cryptography for practical use. This paper overcomes these problems by introducing a chaos-based hash function implemented using fixed point representation which computes digital chaotic maps using integers. Its design is based on the Merkle–Damgård construction and the generalised Feistel structure for strong security justifications. Security evaluation indicates that the proposed hash function has near-perfect statistical properties which include diffusion, confusion, collision resistance and distribution. The proposed hash function also surpasses existing chaos-based hash functions in terms of performance, making it a viable hash function for practical implementation.

History

Journal

Cluster Computing

Volume

22

Pagination

649-660

Location

Berlin, Germany

ISSN

1386-7857

eISSN

1573-7543

Language

en

Publication classification

C1.1 Refereed article in a scholarly journal

Issue

2

Publisher

Springer Science and Business Media LLC

Usage metrics

    Research Publications

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC