Welcome to the resource topic for 2025/1615
Title:
The Chaotic Entropic Expansion (CEE): A Transparent Post-Quantum Data Confidentiality Primitive via Entropic Chaotic Maps
Authors: MINKA MI NGUIDJOI Thierry Emmanuel
Abstract:Weintroduce the Chaotic Entropic Expansion (CEE), a new one-way function based on iterated
polynomial maps over finite fields. For polynomials f in a carefully defined class Fd, we
prove that N iterations preserve min-entropy of at least log2q − N log2d bits and achieve
statistical distance ≤ (q − 1)(dN − 1)/(2√q) from uniform. We formalize security through the
Affine Iterated Inversion Problem (AIIP) and provide reductions to the hardness of solving
multivariate quadratic equations (MQ) and computing discrete logarithms (DLP).
Against quantum adversaries, CEE achieves O(2λ/2) security for λ-bit classical security. We
provide comprehensive cryptanalysis and parameter recommendations for practical deployment.
While slower than AES, CEE’s algebraic structure enables unique applications in verifiable
computation and post-quantum cryptography within the CASH framework.
ePrint: https://eprint.iacr.org/2025/1615
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .