On the Intractability of Chaotic Symbolic Walks: toward a Non-Algebraic Post-Quantum Hardness Assumption

Most classical and post-quantum cryptographic assumptions, including integer factorization, discrete logarithms, and Learning with Errors LWE, rely on algebraic structures such as rings or vector spaces. While mathematically powerful, these structures can be exploited by quantum algorithms or...