The Hashed Fractal Key Recovery (HFKR) Problem: From Symbolic Path Inversion to Post-Quantum Cryptographic Keys

📅 2025-06-04
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
Traditional algebraic cryptosystems (e.g., RSA, ECC, lattice-based schemes) exhibit vulnerabilities under quantum attacks and structural cryptanalysis. Method: This paper proposes HFKR, a structure-free, quantum-resistant key generation scheme. It employs contraction-affine mappings over ℤ² to generate chaotic symbolic trajectories; characterizes their self-similarity and space-filling complexity via fractal dimension (empirically ≈1.06); and applies SHA3-512/SHAKE256 hashing for entropy amplification and chaotic parameter perturbation. Results: Under 250 perturbations, generated keys achieve a mean Hamming distance of 255, near-ideal bit-flip rates, and negligible entropy deviation; BLAKE3 underperforms due to insufficient diffusion. This work pioneers the rigorous integration of fractal geometry with cryptographic entropy modeling, establishing a lightweight, algebraically unstructured, and provably quantum-resistant paradigm.

Technology Category

Application Category

📝 Abstract
Classical cryptographic systems rely heavily on structured algebraic problems, such as factorization, discrete logarithms, or lattice-based assumptions, which are increasingly vulnerable to quantum attacks and structural cryptanalysis. In response, this work introduces the Hashed Fractal Key Recovery (HFKR) problem, a non-algebraic cryptographic construction grounded in symbolic dynamics and chaotic perturbations. HFKR builds on the Symbolic Path Inversion Problem (SPIP), leveraging symbolic trajectories generated via contractive affine maps over $mathbb{Z}^2$, and compressing them into fixed-length cryptographic keys using hash-based obfuscation. A key contribution of this paper is the empirical confirmation that these symbolic paths exhibit fractal behavior, quantified via box counting dimension, path geometry, and spatial density measures. The observed fractal dimension increases with trajectory length and stabilizes near 1.06, indicating symbolic self-similarity and space-filling complexity, both of which reinforce the entropy foundation of the scheme. Experimental results across 250 perturbation trials show that SHA3-512 and SHAKE256 amplify symbolic divergence effectively, achieving mean Hamming distances near 255, ideal bit-flip rates, and negligible entropy deviation. In contrast, BLAKE3 exhibits statistically uniform but weaker diffusion. These findings confirm that HFKR post-quantum security arises from the synergy between symbolic fractality and hash-based entropy amplification. The resulting construction offers a lightweight, structure-free foundation for secure key generation in adversarial settings without relying on algebraic hardness assumptions.
Problem

Research questions and friction points this paper is trying to address.

Introduces HFKR problem for post-quantum cryptographic keys
Leverages symbolic dynamics and chaotic perturbations for security
Confirms fractal behavior in symbolic paths for entropy
Innovation

Methods, ideas, or system contributions that make the work stand out.

Hashed Fractal Key Recovery (HFKR) problem introduced
Symbolic dynamics and chaotic perturbations used
Hash-based obfuscation for key compression
🔎 Similar Papers
2024-08-13International Conferences on Information Science and SystemCitations: 0
💼 Related Jobs
No related jobs found.
M
M. Bouke
Department of Communication Technology and Network, Faculty of Computer Science and Information Technology, Universiti Putra Malaysia, Serdang 43400, Malaysia