A chaotic flux cipher based on the random cubic family $f_{c_n}(z)=z^3+c_n z$

• URL: http://arxiv.org/abs/2603.20937v1
• Date: Sat, 21 Mar 2026 20:35:40 GMT
• Title: A chaotic flux cipher based on the random cubic family $f_{c_n}(z)=z^3+c_n z$
• Abstract summary: This paper presents a symmetric stream cipher that utilizes the dynamic properties of random mappings in the complex cubic plane to generate pseudo-random key streams.<n>The Python implementation integrates secure key derivation, robust key stream generation via warmed-up, and an authenticated encryption using the modern cryptographic primitives.
• Score: 37.406100634766645
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper presents a symmetric stream cipher that utilizes the dynamic properties of random cubic mappings in the complex plane to generate pseudo-random key streams. The system is based on the iterations of the random cubic polynomial $f_n(z)=z^3+c_n z$, where the parameters $c_n$ are chosen randomly from a disc of radius $δ$ and with center at the origin, aiming to improve the chaotic behaviour and, consequently, the randomness of the generated sequence. The stability of the Julia set under small parameter perturbations, when $δ< δ_0\simeq 0.89$, is considered to ensure key consistency in noisy environments, such as 5G networks. On the other hand, for $δ> 3$, the system exhibits instability and chaos, ideal for generating ultra-secure keys. The Python implementation integrates secure key derivation, robust key stream generation via warmed-up iteration, and an authenticated encryption scheme using the modern cryptographic primitives (\texttt{HKDF} and\texttt{HMAC-SHA-256}), to ensure message integrity and authenticity. Statistical analyses, including chi-square test and entropy calculation, are performed on the output of the key stream generator to evaluate its randomness and distribution. In addition, a complete statistical validation, compliant with \texttt{NIST SP 800-22} standards in modern cryptography, was performed to enhance the proposed system's credibility.

Related papers

• On the Probabilistic Learnability of Compact Neural Network Preimage Bounds [71.59148070050212]
  In this work, we adopt a novel probabilistic perspective, aiming to deliver solutions with high-confidence guarantees and bounded error.<n>We introduce $textbfR$andom $textbfF$orest $textbfPro$perty $textbfVe$rifier ($texttRF-ProVe$), a method that exploits an ensemble of randomized decision trees to generate candidate input regions satisfying a desired output property.<n>Our theoretical derivations offer formal statistical guarantees on region purity and global coverage, providing a practical, scalable solution for computing
  arXiv  Detail & Related papers  (2025-11-10T16:56:51Z)
• Optimizing Scalar Selection in Elliptic Curve Cryptography Using Differential Evolution for Enhanced Security [0.0]
  Elliptic Curve Cryptography (ECC) is a fundamental component of modern public-key cryptosystems.<n>We introduce an optimization-driven scalar generation method that explicitly maximizes bit-level entropy.<n>The proposed method can be integrated into existing ECC-based protocols, offering a deterministic, tunable alternative to traditional randomness.
  arXiv  Detail & Related papers  (2025-08-19T05:26:07Z)
• Extended c-differential distinguishers of full 9 and reduced-round Kuznyechik cipher [1.4407799786341453]
  We introduce truncated $c$-differential analysis against the full 9-round Kuznyechik cipher with no key pre-whitening.<n>This is the first practical distinguisher against a full 9-round Kuznyechik variant.
  arXiv  Detail & Related papers  (2025-07-02T22:27:33Z)
• Deterministic Cryptographic Seed Generation via Cyclic Modular Inversion over $\mathbb{Z}/3^p\mathbb{Z}$ [0.0]
  We present a framework for cryptographic seed generation based on cyclic modular inversion over $mathbbZ/3pmathbbZ$.<n>The mapping yields entropy-rich, cycle-complete seeds well-suited for cryptographic primitives such as DRBGs, KDFs, and post-quantum schemes.
  arXiv  Detail & Related papers  (2025-07-02T00:17:55Z)
• Rényi divergence-based uniformity guarantees for $k$-universal hash functions [53.80737717363129]
  Universal hash functions map the output of a source to random strings over a finite alphabet.<n>We show that it is possible to distill random bits that are nearly uniform, as measured by min-entropy.
  arXiv  Detail & Related papers  (2024-10-21T19:37:35Z)
• Local contextuality-based self-tests are sufficient for randomness expansion secure against quantum adversaries [0.0]
  We show that local contextuality-based self-tests are sufficient to construct a randomness expansion protocol that is secure against unbounded quantum adversaries. Our protocol is based on self-testing from non-contextuality inequalities and we prove that our schemeally produces secure random numbers which are $mathcalO(mstepsilon)$-close to uniformly distributed and private.
  arXiv  Detail & Related papers  (2024-09-30T08:31:46Z)
• Cryptographically Secure Pseudo-Random Number Generation (CS-PRNG) Design using Robust Chaotic Tent Map (RCTM) [2.0448353403141515]
  This paper presents a novel method to generate cryptographically secure pseudo-random numbers (CSPRNG) using a robust chaotic tent map (RCTM) Various statistical tests are performed that ascertain the randomness of generated secure pseudo-random bits.
  arXiv  Detail & Related papers  (2024-08-10T15:16:00Z)
• Signatures From Pseudorandom States via $\ot$-PRFs [0.11650821883155184]
  We introduce new definitions for $bot$-PRG and $bot$-PRF. Our main application is a (quantum) digital signature scheme with classical public keys and signatures.
  arXiv  Detail & Related papers  (2023-11-01T20:54:50Z)
• Publicly-Verifiable Deletion via Target-Collapsing Functions [81.13800728941818]
  We show that targetcollapsing enables publiclyverifiable deletion (PVD) We build on this framework to obtain a variety of primitives supporting publiclyverifiable deletion from weak cryptographic assumptions.
  arXiv  Detail & Related papers  (2023-03-15T15:00:20Z)
• Improved, Deterministic Smoothing for L1 Certified Robustness [119.86676998327864]
  We propose a non-additive and deterministic smoothing method, Deterministic Smoothing with Splitting Noise (DSSN) In contrast to uniform additive smoothing, the SSN certification does not require the random noise components used to be independent. This is the first work to provide deterministic "randomized smoothing" for a norm-based adversarial threat model.
  arXiv  Detail & Related papers  (2021-03-17T21:49:53Z)
• A Randomized Algorithm to Reduce the Support of Discrete Measures [79.55586575988292]
  Given a discrete probability measure supported on $N$ atoms and a set of $n$ real-valued functions, there exists a probability measure that is supported on a subset of $n+1$ of the original $N$ atoms. We give a simple geometric characterization of barycenters via negative cones and derive a randomized algorithm that computes this new measure by "greedy geometric sampling" We then study its properties, and benchmark it on synthetic and real-world data to show that it can be very beneficial in the $Ngg n$ regime.
  arXiv  Detail & Related papers  (2020-06-02T16:38:36Z)
• Black-Box Certification with Randomized Smoothing: A Functional Optimization Based Framework [60.981406394238434]
  We propose a general framework of adversarial certification with non-Gaussian noise and for more general types of attacks. Our proposed methods achieve better certification results than previous works and provide a new perspective on randomized smoothing certification.
  arXiv  Detail & Related papers  (2020-02-21T07:52:47Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.