Gang-Cheng Huang

Dr. Gang-Cheng Huang

Computer Science and Information Engineering, China University of Technology, Taipei, Taiwan
orcid
work

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 November 2024 in Symmetry
Verified
Journal Article
Open access
PDF file
Gang-Cheng HuangGang-Cheng Huang
Gang-Cheng Huang
KCKo-Chin Chang
Ko-Chin Chang
TLTai-Hung Lai
Tai-Hung Lai
This study employed chaotic systems as an innovative approach for shellcode obfuscation to evade current antivirus detection methods. Standard AV solutions primarily rely on static signatures and heuristic analysis to identify malicious code. However, chaotic systems employ dynamic and unpredictable encryption methods, significantly obstructing detection efforts. The utilization of various chaotic maps for shellcode encryption facilitates the generation of multiple unique variations from the same functional code, each exhibiting distinct unpredictability due to the inherent nonlinearity and sensitivity of chaotic systems to initial conditions. The unpredictability of these situations poses a considerable challenge for antivirus software in recognizing consistent patterns, resulting in decreased detection rates. The findings from our experiments demonstrate that chaos-driven encryption methods significantly outperform traditional encryption techniques in terms of evading detection. This paper emphasizes the potential of chaos theory to enhance malware evasion strategies, offering a sophisticated approach to bypassing modern antivirus protections while ensuring the effectiveness of malicious payloads.

15 January 2025 in Sensors
Verified
Journal Article
Open access
PDF file
Gang-Cheng HuangGang-Cheng Huang
Gang-Cheng Huang
KCKo-Chin Chang
Ko-Chin Chang
TLTai-Hung Lai
Tai-Hung Lai
In this study, we propose a method for successfully evading antivirus detection by encoding malicious shellcode with fountain codes. The Meterpreter framework for Microsoft Windows 32-bit and 64-bit architectures was used to produce the shellcode used in this investigation. The experimental results proved that detection rates were substantially decreased. Specifically, the number of detected instances using antivirus vendors for 32-bit shellcode decreased from 18 to 3, while for 64-bit shellcode, it decreased from 16 to 1. This method breaks up a malicious payload into many packets, each with their own distinct structure, and then encodes them. This obfuscation approach maintains the shellcode’s integrity, ensuring correct code execution. However, in the persistence phase of the penetration testing process, this method offers an additional means of evading antivirus techniques.

1 November 2025 in Symmetry
Verified
Journal Article
Open access
PDF file
Gang-Cheng HuangGang-Cheng Huang
Gang-Cheng Huang
This study applies reinforcement learning to search parameter regimes that yield chaotic dynamics across six systems: the Logistic map, the Hénon map, the Lorenz system, Chua’s circuit, the Lorenz–Haken model, and a custom 5D hyperchaotic design. The largest Lyapunov exponent (LLE) is used as a scalar reward to guide exploration toward regions with high sensitivity to initial conditions. Under matched evaluation budgets, the approach reduces redundant simulations relative to grid scans and accelerates discovery of parameter sets with large positive LLE. Experiments report learning curves, parameter heatmaps, and representative phase portraits that are consistent with Lyapunov-based assessments. Q-learning typically reaches high-reward regions earlier, whereas SARSA shows smoother improvements over iterations. Several evaluated systems possess equation-level symmetry—most notably sign-reversal invariance in the Lorenz system and Chua’s circuit models and a coordinate-wise sign pattern in the Lorenz–Haken equations—which manifests as mirror attractors and paired high-reward regions; one representative is reported for each symmetric pair. Overall, Lyapunov-guided reinforcement learning serves as a practical complement to grid and random search for chaos identification in both discrete maps and continuous flows, and transfers with minimal changes to higher-dimensional settings. The framework provides an efficient method for identifying high-complexity parameters for applications in chaos-based cryptography and for assessing stability boundaries in engineering design.

9 April 2026 in Physica Scripta
Verified
Journal Article
Closed access
Gang-Cheng HuangGang-Cheng Huang
Gang-Cheng Huang
Reducing the fractional derivative order typically weakens chaotic oscillations, making it difficult to discover multi-scroll attractors that remain recognizable when q < 1. To address this challenge, this study proposes a unified artificial intelligence-driven framework for the autonomous discovery and validation of multi-scroll attractors. The proposed framework employs a Proximal Policy Optimization (PPO) agent to search the parameter space of 3D jerk and 4D hyper-jerk systems in the integer-order domain ( q = 1), utilizing trajectory-based rewards to promote scroll expansion and chaotic instability. The discovered parameter sets are then tested under fractional-order dynamics using a predictor-corrector Adams-Bashforth-Moulton solver to evaluate their persistence. Testing is quantified through an amplitude-based robustness measure, A ( q ), defined as the peak-to-peak range of the state variable x , along with an operational critical order q crit . The results suggest that the proposed AI-driven dynamics workflow can serve as a reproducible protocol for data-driven parameter discovery and robustness assessment in nonlinear dynamical systems.

2 April 2026 in Physical Review E
Verified
Journal Article
Closed access
Gang-Cheng HuangGang-Cheng Huang
Gang-Cheng Huang
The fractional Kuramoto-Sivashinsky equation (F-KSE) describes a class of spatiotemporal chaotic systems characterized by nonlocal dissipative interactions. Controlling such systems presents significant challenges due to the interplay between nonlinear convection and fractional diffusion. This study investigates a model-free feedback control framework to stabilize the F-KSE. By formulating the control problem as a high-dimensional optimization task, a continuous control law is derived without assuming prior knowledge of the governing equations. Numerical experiments demonstrate that the proposed controller effectively suppresses chaotic wave shedding, forcing the system into a near-trivial stationary state with an energy reduction consistently exceeding 96% (reaching a peak of 98.55% across the diffusive regime). Spectral analysis reveals that the stabilization is achieved through broadband suppression of dominant instability modes. Most notably, a sensitivity analysis demonstrates that a single control policy, trained at a specific fractional order (α=1.85), exhibits universal robustness across the regime α∈[1.0,2.0] without retraining. This suggests the data-driven agent identifies a dominant stabilization mechanism that primarily counteracts energy-containing structures driven by the convective nonlinearity. The resulting policy is largely invariant to the underlying dissipative structure.

22 July 2026 in Physica Scripta
Verified
Journal Article
Closed access
Gang-Cheng HuangGang-Cheng Huang
Gang-Cheng Huang
The emulation of complex nonlinear dynamics on near-term quantum processors is strongly constrained by hardware noise, as direct dynamic mapping typically requires deep circuits. To address this limitation in studying chaotic systems, this work proposes a diagnostic-level compact quantum surrogate strategy for reproducing selected early-time scrambling signatures of hyperchaos, rather than a trajectory-faithful reconstruction of the full classical dynamics. A hybrid quantum architecture search framework is employed as the discovery tool, integrating reinforcement learning for discrete topological exploration with gradient-based optimization for parameter fine-tuning. This approach identifies sparse circuit structures, requiring fewer than ten gates for the 4D diagnostic target, that reduce the topological overhead associated with standard hardware-efficient templates in this setting. The discovered diagnostic surrogates reproduce selected early-time log-out-of-time-ordered correlator features, including an effective scrambling slope λ Q eff and curve-level profile metrics, rather than a full classical trajectory. Density-matrix simulations further evaluate the response of the compact circuits under depolarizing, phase-damping, and amplitude-damping noise channels. The resulting circuits are interpreted as observable-level diagnostic models for a prescribed scrambling indicator, rather than as physically equivalent surrogates of the underlying hyperchaotic flow. Together with multi-seed 5D tests, curve-level validation, and hardware-executability checks, the results clarify both the utility and the limitations of diagnostic-level compact surrogates for selected scrambling signatures in noise-limited quantum settings.