Intermittent Impulsive Synchronization of Hyperchaos with Application to Secure Communication
Bibliographic record
Abstract
Abstract In this paper, a hyperchaotic system is presented as the chaotic carrier to encrypt information in secure communication. The sensitivity to the system parameters and delay of the hyperchaotic system, i.e., its chaotic degree indicated by the number of positive Lyapunov exponents, increases with its system parameter and delay, guaranteeing a large enough key space when one selects its system parameter and delay as the secret key. Furthermore, we develop an intermittent impulsive synchronization scheme (IISS) to achieve chaos synchronization, a crucial process in chaos‐based secure communication. In our scheme, impulsive control is only activated in the control windows, not during the whole time, which breaks through the limitation on the upper bound of the impulsive intervals in the general impulsive synchronization scheme (GISS). Specifically, IISS improves the security of the chaos‐based secure communication scheme since the encrypted signal (cipher) is transmitted in the free windows, different from the synchronization signal in the control windows. Finally, a secure communication scheme employing our hyperchaotic system and IISS technique is proposed and numerical results are given to demonstrate the performance of this scheme.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".