CHAOTIC ONE-WAY FUNCTIONS WITH GUARANTEED LOWER BOUND OF INVERSION COMPLEXITY
Sergey B. Kuznetsov
Sirius University, Sochi, Russian Federation
Keywords: one-way function, chaos, logistic mapping, conditional entropy, KDF, lightweight cryptography, irreversibility, side-channel
Abstract
In this paper, we propose a new chaotic one-way function ChaosKDF that combines the logistic map and cryptographically secure pseudo-random noise from the ChaCha20 generator. The irreversibility of the function is due to the exponential sensitivity to initial conditions and the addition of controlled noise, which leads to rapid degradation of information about the input. Based on information theory, we show that the conditional entropy grows no slower than a linear function of the input size n in bits with an increase in the number of iterations T. This provides a provable lower bound on the complexity of inversion: Ω(ε·2n·T). This makes the function computationally irreversible even for quantum adversaries. It is proven that for an input of at least 256 and an iteration number of 1000, the function is resistant to Grover’s attacks and quantum methods for analyzing dynamical systems, such as QPE and VQA, due to chaos and cryptographic noise. An analysis of side-channel vulnerabilities is performed, and protective measures are proposed, including a fixed number of iterations and energy consumption masking. A comparison with PRF (HMAC-based), HMAC-based KDF, streaming PRF and upgraded KDF demonstrates a balance between security, speed and energy efficiency. This makes it effective for resource-constrained environments such as IoT and PUF systems. The function generates a 56-bit output compatible with modern cryptographic standards. The work opens the way to physically motivated cryptographic primitives, where security is based on dynamic irreversibility rather than algebraic complexity.
|